What is the Greatest Common Factor of 16962 and 16968?

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

GCF(16962,16968) = 6

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

How to find the GCF of 16962 and 16968?

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

Prime factors of 16968 are 2, 3, 7, 101. Prime factorization of 16968 in exponential form is:

16968 = 2³ × 3¹ × 7¹ × 101¹

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 16968

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

1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 101, 168, 202, 303, 404, 606, 707, 808, 1212, 1414, 2121, 2424, 2828, 4242, 5656, 8484

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16962 and 16968