What is the Greatest Common Factor of 16951 and 16964?

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

GCF(16951,16964) = 1

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

How to find the GCF of 16951 and 16964?

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

Prime factors of 16964 are 2, 4241. Prime factorization of 16964 in exponential form is:

16964 = 2² × 4241¹

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 16964

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

1, 2, 4, 4241, 8482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16951 and 16964