What is the Greatest Common Factor of 55978 and 55993?

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

GCF(55978,55993) = 1

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

How to find the GCF of 55978 and 55993?

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

Step-1: 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-2: Prime Factorization of 55993

Prime factors of 55993 are 7, 19, 421. Prime factorization of 55993 in exponential form is:

55993 = 7¹ × 19¹ × 421¹

Step-3: Factors of 55978

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

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

Step-4: Factors of 55993

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

1, 7, 19, 133, 421, 2947, 7999

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55978 and 55993