What is the Greatest Common Factor of 12147 and 12160?

Greatest common factor (GCF) of 12147 and 12160 is 1.

GCF(12147,12160) = 1

We will now calculate the prime factors of 12147 and 12160, than find the greatest common factor (greatest common divisor (gcd)) of the numbers by matching the biggest common factor of 12147 and 12160.

How to find the GCF of 12147 and 12160?

We will first find the prime factorization of 12147 and 12160. After we will calculate the factors of 12147 and 12160 and find the biggest common factor number .

Step-1: Prime Factorization of 12147

Prime factors of 12147 are 3, 4049. Prime factorization of 12147 in exponential form is:

12147 = 3¹ × 4049¹

Step-2: Prime Factorization of 12160

Prime factors of 12160 are 2, 5, 19. Prime factorization of 12160 in exponential form is:

12160 = 2⁷ × 5¹ × 19¹

Step-3: Factors of 12147

List of positive integer factors of 12147 that divides 12147 without a remainder.

1, 3, 4049

Step-4: Factors of 12160

List of positive integer factors of 12160 that divides 12147 without a remainder.

1, 2, 4, 5, 8, 10, 16, 19, 20, 32, 38, 40, 64, 76, 80, 95, 128, 152, 160, 190, 304, 320, 380, 608, 640, 760, 1216, 1520, 2432, 3040, 6080

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 12147 and 12160. The biggest common factor number is the GCF number.
So the greatest common factor 12147 and 12160 is 1.

Also check out the Least Common Multiple of 12147 and 12160