What is the Greatest Common Factor of 55961 and 55978?

Greatest common factor (GCF) of 55961 and 55978 is 1.

GCF(55961,55978) = 1

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

How to find the GCF of 55961 and 55978?

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

Step-1: Prime Factorization of 55961

Prime factors of 55961 are 107, 523. Prime factorization of 55961 in exponential form is:

55961 = 107¹ × 523¹

Step-2: Prime Factorization of 55978

Prime factors of 55978 are 2, 13, 2153. Prime factorization of 55978 in exponential form is:

55978 = 2¹ × 13¹ × 2153¹

Step-3: Factors of 55961

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

1, 107, 523

Step-4: Factors of 55978

List of positive integer factors of 55978 that divides 55961 without a remainder.

1, 2, 13, 26, 2153, 4306, 27989

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55961 and 55978