What is the Greatest Common Factor of 16962 and 16980?

Greatest common factor (GCF) of 16962 and 16980 is 6.

GCF(16962,16980) = 6

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

How to find the GCF of 16962 and 16980?

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

Step-1: Prime Factorization of 16962

Prime factors of 16962 are 2, 3, 11, 257. Prime factorization of 16962 in exponential form is:

16962 = 2¹ × 3¹ × 11¹ × 257¹

Step-2: Prime Factorization of 16980

Prime factors of 16980 are 2, 3, 5, 283. Prime factorization of 16980 in exponential form is:

16980 = 2² × 3¹ × 5¹ × 283¹

Step-3: Factors of 16962

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

1, 2, 3, 6, 11, 22, 33, 66, 257, 514, 771, 1542, 2827, 5654, 8481

Step-4: Factors of 16980

List of positive integer factors of 16980 that divides 16962 without a remainder.

1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 283, 566, 849, 1132, 1415, 1698, 2830, 3396, 4245, 5660, 8490

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16962 and 16980