What is the Greatest Common Factor of 20961 and 20968?

Greatest common factor (GCF) of 20961 and 20968 is 1.

GCF(20961,20968) = 1

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

How to find the GCF of 20961 and 20968?

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

Step-1: Prime Factorization of 20961

Prime factors of 20961 are 3, 17, 137. Prime factorization of 20961 in exponential form is:

20961 = 3² × 17¹ × 137¹

Step-2: Prime Factorization of 20968

Prime factors of 20968 are 2, 2621. Prime factorization of 20968 in exponential form is:

20968 = 2³ × 2621¹

Step-3: Factors of 20961

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

1, 3, 9, 17, 51, 137, 153, 411, 1233, 2329, 6987

Step-4: Factors of 20968

List of positive integer factors of 20968 that divides 20961 without a remainder.

1, 2, 4, 8, 2621, 5242, 10484

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 20961 and 20968