What is the Greatest Common Factor of 20951 and 20964?

Greatest common factor (GCF) of 20951 and 20964 is 1.

GCF(20951,20964) = 1

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

How to find the GCF of 20951 and 20964?

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

Step-1: Prime Factorization of 20951

Prime factors of 20951 are 7, 41, 73. Prime factorization of 20951 in exponential form is:

20951 = 7¹ × 41¹ × 73¹

Step-2: Prime Factorization of 20964

Prime factors of 20964 are 2, 3, 1747. Prime factorization of 20964 in exponential form is:

20964 = 2² × 3¹ × 1747¹

Step-3: Factors of 20951

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

1, 7, 41, 73, 287, 511, 2993

Step-4: Factors of 20964

List of positive integer factors of 20964 that divides 20951 without a remainder.

1, 2, 3, 4, 6, 12, 1747, 3494, 5241, 6988, 10482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 20951 and 20964