What is the Greatest Common Factor of 49558 and 49564?

Greatest common factor (GCF) of 49558 and 49564 is 2.

GCF(49558,49564) = 2

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

How to find the GCF of 49558 and 49564?

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

Step-1: Prime Factorization of 49558

Prime factors of 49558 are 2, 71, 349. Prime factorization of 49558 in exponential form is:

49558 = 2¹ × 71¹ × 349¹

Step-2: Prime Factorization of 49564

Prime factors of 49564 are 2, 12391. Prime factorization of 49564 in exponential form is:

49564 = 2² × 12391¹

Step-3: Factors of 49558

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

1, 2, 71, 142, 349, 698, 24779

Step-4: Factors of 49564

List of positive integer factors of 49564 that divides 49558 without a remainder.

1, 2, 4, 12391, 24782

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49558 and 49564