What is the Greatest Common Factor of 16146 and 16159?

Greatest common factor (GCF) of 16146 and 16159 is 13.

GCF(16146,16159) = 13

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

How to find the GCF of 16146 and 16159?

We will first find the prime factorization of 16146 and 16159. After we will calculate the factors of 16146 and 16159 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 16159

Prime factors of 16159 are 11, 13, 113. Prime factorization of 16159 in exponential form is:

16159 = 11¹ × 13¹ × 113¹

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 16159

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

1, 11, 13, 113, 143, 1243, 1469

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16146 and 16159