What is the Greatest Common Factor of 16146 and 16158?

Greatest common factor (GCF) of 16146 and 16158 is 6.

GCF(16146,16158) = 6

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

How to find the GCF of 16146 and 16158?

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

Step-1: Prime Factorization of 16146

Prime factors of 16146 are 2, 3, 13, 23. Prime factorization of 16146 in exponential form is:

16146 = 2¹ × 3³ × 13¹ × 23¹

Step-2: Prime Factorization of 16158

Prime factors of 16158 are 2, 3, 2693. Prime factorization of 16158 in exponential form is:

16158 = 2¹ × 3¹ × 2693¹

Step-3: Factors of 16146

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

1, 2, 3, 6, 9, 13, 18, 23, 26, 27, 39, 46, 54, 69, 78, 117, 138, 207, 234, 299, 351, 414, 598, 621, 702, 897, 1242, 1794, 2691, 5382, 8073

Step-4: Factors of 16158

List of positive integer factors of 16158 that divides 16146 without a remainder.

1, 2, 3, 6, 2693, 5386, 8079

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 16146 and 16158. The biggest common factor number is the GCF number.
So the greatest common factor 16146 and 16158 is 6.

Also check out the Least Common Multiple of 16146 and 16158