What is the Greatest Common Factor of 55913 and 55932?

Greatest common factor (GCF) of 55913 and 55932 is 1.

GCF(55913,55932) = 1

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

How to find the GCF of 55913 and 55932?

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

Step-1: Prime Factorization of 55913

Prime factors of 55913 are 11, 13, 17, 23. Prime factorization of 55913 in exponential form is:

55913 = 11¹ × 13¹ × 17¹ × 23¹

Step-2: Prime Factorization of 55932

Prime factors of 55932 are 2, 3, 59, 79. Prime factorization of 55932 in exponential form is:

55932 = 2² × 3¹ × 59¹ × 79¹

Step-3: Factors of 55913

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

1, 11, 13, 17, 23, 143, 187, 221, 253, 299, 391, 2431, 3289, 4301, 5083

Step-4: Factors of 55932

List of positive integer factors of 55932 that divides 55913 without a remainder.

1, 2, 3, 4, 6, 12, 59, 79, 118, 158, 177, 236, 237, 316, 354, 474, 708, 948, 4661, 9322, 13983, 18644, 27966

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55913 and 55932