What is the Greatest Common Factor of 55638 and 55642?

Greatest common factor (GCF) of 55638 and 55642 is 2.

GCF(55638,55642) = 2

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

How to find the GCF of 55638 and 55642?

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

Step-1: Prime Factorization of 55638

Prime factors of 55638 are 2, 3, 11, 281. Prime factorization of 55638 in exponential form is:

55638 = 2¹ × 3² × 11¹ × 281¹

Step-2: Prime Factorization of 55642

Prime factors of 55642 are 2, 43, 647. Prime factorization of 55642 in exponential form is:

55642 = 2¹ × 43¹ × 647¹

Step-3: Factors of 55638

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

1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 99, 198, 281, 562, 843, 1686, 2529, 3091, 5058, 6182, 9273, 18546, 27819

Step-4: Factors of 55642

List of positive integer factors of 55642 that divides 55638 without a remainder.

1, 2, 43, 86, 647, 1294, 27821

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55638 and 55642