What is the Greatest Common Factor of 16951 and 16965?

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

GCF(16951,16965) = 1

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

How to find the GCF of 16951 and 16965?

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

Prime factors of 16965 are 3, 5, 13, 29. Prime factorization of 16965 in exponential form is:

16965 = 3² × 5¹ × 13¹ × 29¹

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 16965

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

1, 3, 5, 9, 13, 15, 29, 39, 45, 65, 87, 117, 145, 195, 261, 377, 435, 585, 1131, 1305, 1885, 3393, 5655

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16951 and 16965