What is the Greatest Common Factor of 55959 and 55964?

Greatest common factor (GCF) of 55959 and 55964 is 1.

GCF(55959,55964) = 1

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

How to find the GCF of 55959 and 55964?

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

Step-1: Prime Factorization of 55959

Prime factors of 55959 are 3, 23, 811. Prime factorization of 55959 in exponential form is:

55959 = 3¹ × 23¹ × 811¹

Step-2: Prime Factorization of 55964

Prime factors of 55964 are 2, 17, 823. Prime factorization of 55964 in exponential form is:

55964 = 2² × 17¹ × 823¹

Step-3: Factors of 55959

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

1, 3, 23, 69, 811, 2433, 18653

Step-4: Factors of 55964

List of positive integer factors of 55964 that divides 55959 without a remainder.

1, 2, 4, 17, 34, 68, 823, 1646, 3292, 13991, 27982

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55959 and 55964