What is the Greatest Common Factor of 16940 and 16951?

Greatest common factor (GCF) of 16940 and 16951 is 11.

GCF(16940,16951) = 11

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

How to find the GCF of 16940 and 16951?

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

Step-1: Prime Factorization of 16940

Prime factors of 16940 are 2, 5, 7, 11. Prime factorization of 16940 in exponential form is:

16940 = 2² × 5¹ × 7¹ × 11²

Step-2: Prime Factorization of 16951

Prime factors of 16951 are 11, 23, 67. Prime factorization of 16951 in exponential form is:

16951 = 11¹ × 23¹ × 67¹

Step-3: Factors of 16940

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

1, 2, 4, 5, 7, 10, 11, 14, 20, 22, 28, 35, 44, 55, 70, 77, 110, 121, 140, 154, 220, 242, 308, 385, 484, 605, 770, 847, 1210, 1540, 1694, 2420, 3388, 4235, 8470

Step-4: Factors of 16951

List of positive integer factors of 16951 that divides 16940 without a remainder.

1, 11, 23, 67, 253, 737, 1541

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 16940 and 16951. The biggest common factor number is the GCF number.
So the greatest common factor 16940 and 16951 is 11.

Also check out the Least Common Multiple of 16940 and 16951