What is the Greatest Common Factor of 59540 and 59558?

Greatest common factor (GCF) of 59540 and 59558 is 2.

GCF(59540,59558) = 2

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

How to find the GCF of 59540 and 59558?

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

Step-1: Prime Factorization of 59540

Prime factors of 59540 are 2, 5, 13, 229. Prime factorization of 59540 in exponential form is:

59540 = 2² × 5¹ × 13¹ × 229¹

Step-2: Prime Factorization of 59558

Prime factors of 59558 are 2, 97, 307. Prime factorization of 59558 in exponential form is:

59558 = 2¹ × 97¹ × 307¹

Step-3: Factors of 59540

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

1, 2, 4, 5, 10, 13, 20, 26, 52, 65, 130, 229, 260, 458, 916, 1145, 2290, 2977, 4580, 5954, 11908, 14885, 29770

Step-4: Factors of 59558

List of positive integer factors of 59558 that divides 59540 without a remainder.

1, 2, 97, 194, 307, 614, 29779

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 59540 and 59558. The biggest common factor number is the GCF number.
So the greatest common factor 59540 and 59558 is 2.

Also check out the Least Common Multiple of 59540 and 59558