What is the Greatest Common Factor of 16956 and 16968?

Greatest common factor (GCF) of 16956 and 16968 is 12.

GCF(16956,16968) = 12

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

How to find the GCF of 16956 and 16968?

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

Step-1: Prime Factorization of 16956

Prime factors of 16956 are 2, 3, 157. Prime factorization of 16956 in exponential form is:

16956 = 2² × 3³ × 157¹

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 16956

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

1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 157, 314, 471, 628, 942, 1413, 1884, 2826, 4239, 5652, 8478

Step-4: Factors of 16968

List of positive integer factors of 16968 that divides 16956 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 16956 and 16968. The biggest common factor number is the GCF number.
So the greatest common factor 16956 and 16968 is 12.

Also check out the Least Common Multiple of 16956 and 16968