What is the Greatest Common Factor of 12146 and 12159?

Greatest common factor (GCF) of 12146 and 12159 is 1.

GCF(12146,12159) = 1

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

How to find the GCF of 12146 and 12159?

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

Step-1: Prime Factorization of 12146

Prime factors of 12146 are 2, 6073. Prime factorization of 12146 in exponential form is:

12146 = 2¹ × 6073¹

Step-2: Prime Factorization of 12159

Prime factors of 12159 are 3, 7, 193. Prime factorization of 12159 in exponential form is:

12159 = 3² × 7¹ × 193¹

Step-3: Factors of 12146

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

1, 2, 6073

Step-4: Factors of 12159

List of positive integer factors of 12159 that divides 12146 without a remainder.

1, 3, 7, 9, 21, 63, 193, 579, 1351, 1737, 4053

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 12146 and 12159