What is the Greatest Common Factor of 55678 and 55690?

Greatest common factor (GCF) of 55678 and 55690 is 2.

GCF(55678,55690) = 2

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

How to find the GCF of 55678 and 55690?

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

Step-1: Prime Factorization of 55678

Prime factors of 55678 are 2, 7, 41, 97. Prime factorization of 55678 in exponential form is:

55678 = 2¹ × 7¹ × 41¹ × 97¹

Step-2: Prime Factorization of 55690

Prime factors of 55690 are 2, 5, 5569. Prime factorization of 55690 in exponential form is:

55690 = 2¹ × 5¹ × 5569¹

Step-3: Factors of 55678

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

1, 2, 7, 14, 41, 82, 97, 194, 287, 574, 679, 1358, 3977, 7954, 27839

Step-4: Factors of 55690

List of positive integer factors of 55690 that divides 55678 without a remainder.

1, 2, 5, 10, 5569, 11138, 27845

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 55678 and 55690. The biggest common factor number is the GCF number.
So the greatest common factor 55678 and 55690 is 2.

Also check out the Least Common Multiple of 55678 and 55690