What is the Greatest Common Factor of 16951 and 16956?

Greatest common factor (GCF) of 16951 and 16956 is 1.

GCF(16951,16956) = 1

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

How to find the GCF of 16951 and 16956?

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

Step-1: 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-2: 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-3: Factors of 16951

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

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

Step-4: Factors of 16956

List of positive integer factors of 16956 that divides 16951 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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16951 and 16956