What is the Greatest Common Factor of 55680 and 55693?

Greatest common factor (GCF) of 55680 and 55693 is 1.

GCF(55680,55693) = 1

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

How to find the GCF of 55680 and 55693?

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

Step-1: Prime Factorization of 55680

Prime factors of 55680 are 2, 3, 5, 29. Prime factorization of 55680 in exponential form is:

55680 = 2⁷ × 3¹ × 5¹ × 29¹

Step-2: Prime Factorization of 55693

Prime factors of 55693 are 11, 61, 83. Prime factorization of 55693 in exponential form is:

55693 = 11¹ × 61¹ × 83¹

Step-3: Factors of 55680

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

1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 29, 30, 32, 40, 48, 58, 60, 64, 80, 87, 96, 116, 120, 128, 145, 160, 174, 192, 232, 240, 290, 320, 348, 384, 435, 464, 480, 580, 640, 696, 870, 928, 960, 1160, 1392, 1740, 1856, 1920, 2320, 2784, 3480, 3712, 4640, 5568, 6960, 9280, 11136, 13920, 18560, 27840

Step-4: Factors of 55693

List of positive integer factors of 55693 that divides 55680 without a remainder.

1, 11, 61, 83, 671, 913, 5063

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55680 and 55693