What is the Greatest Common Factor of 68961 and 68980?

Greatest common factor (GCF) of 68961 and 68980 is 1.

GCF(68961,68980) = 1

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

How to find the GCF of 68961 and 68980?

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

Step-1: Prime Factorization of 68961

Prime factors of 68961 are 3, 127, 181. Prime factorization of 68961 in exponential form is:

68961 = 3¹ × 127¹ × 181¹

Step-2: Prime Factorization of 68980

Prime factors of 68980 are 2, 5, 3449. Prime factorization of 68980 in exponential form is:

68980 = 2² × 5¹ × 3449¹

Step-3: Factors of 68961

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

1, 3, 127, 181, 381, 543, 22987

Step-4: Factors of 68980

List of positive integer factors of 68980 that divides 68961 without a remainder.

1, 2, 4, 5, 10, 20, 3449, 6898, 13796, 17245, 34490

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 68961 and 68980