What is the Greatest Common Factor of 55968 and 55979?

Greatest common factor (GCF) of 55968 and 55979 is 11.

GCF(55968,55979) = 11

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

How to find the GCF of 55968 and 55979?

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

Step-1: Prime Factorization of 55968

Prime factors of 55968 are 2, 3, 11, 53. Prime factorization of 55968 in exponential form is:

55968 = 2⁵ × 3¹ × 11¹ × 53¹

Step-2: Prime Factorization of 55979

Prime factors of 55979 are 7, 11, 727. Prime factorization of 55979 in exponential form is:

55979 = 7¹ × 11¹ × 727¹

Step-3: Factors of 55968

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

1, 2, 3, 4, 6, 8, 11, 12, 16, 22, 24, 32, 33, 44, 48, 53, 66, 88, 96, 106, 132, 159, 176, 212, 264, 318, 352, 424, 528, 583, 636, 848, 1056, 1166, 1272, 1696, 1749, 2332, 2544, 3498, 4664, 5088, 6996, 9328, 13992, 18656, 27984

Step-4: Factors of 55979

List of positive integer factors of 55979 that divides 55968 without a remainder.

1, 7, 11, 77, 727, 5089, 7997

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 55968 and 55979. The biggest common factor number is the GCF number.
So the greatest common factor 55968 and 55979 is 11.

Also check out the Least Common Multiple of 55968 and 55979