What is the Greatest Common Factor of 55159 and 55168?

Greatest common factor (GCF) of 55159 and 55168 is 1.

GCF(55159,55168) = 1

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

How to find the GCF of 55159 and 55168?

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

Step-1: Prime Factorization of 55159

Prime factors of 55159 are 13, 4243. Prime factorization of 55159 in exponential form is:

55159 = 13¹ × 4243¹

Step-2: Prime Factorization of 55168

Prime factors of 55168 are 2, 431. Prime factorization of 55168 in exponential form is:

55168 = 2⁷ × 431¹

Step-3: Factors of 55159

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

1, 13, 4243

Step-4: Factors of 55168

List of positive integer factors of 55168 that divides 55159 without a remainder.

1, 2, 4, 8, 16, 32, 64, 128, 431, 862, 1724, 3448, 6896, 13792, 27584

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 55159 and 55168