What is the Greatest Common Factor of 55939 and 55947?

Greatest common factor (GCF) of 55939 and 55947 is 1.

GCF(55939,55947) = 1

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

How to find the GCF of 55939 and 55947?

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

Step-1: Prime Factorization of 55939

Prime factors of 55939 are 13, 331. Prime factorization of 55939 in exponential form is:

55939 = 13² × 331¹

Step-2: Prime Factorization of 55947

Prime factors of 55947 are 3, 17, 1097. Prime factorization of 55947 in exponential form is:

55947 = 3¹ × 17¹ × 1097¹

Step-3: Factors of 55939

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

1, 13, 169, 331, 4303

Step-4: Factors of 55947

List of positive integer factors of 55947 that divides 55939 without a remainder.

1, 3, 17, 51, 1097, 3291, 18649

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55939 and 55947