What is the Greatest Common Factor of 49562 and 49580?

Greatest common factor (GCF) of 49562 and 49580 is 2.

GCF(49562,49580) = 2

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

How to find the GCF of 49562 and 49580?

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

Step-1: Prime Factorization of 49562

Prime factors of 49562 are 2, 24781. Prime factorization of 49562 in exponential form is:

49562 = 2¹ × 24781¹

Step-2: Prime Factorization of 49580

Prime factors of 49580 are 2, 5, 37, 67. Prime factorization of 49580 in exponential form is:

49580 = 2² × 5¹ × 37¹ × 67¹

Step-3: Factors of 49562

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

1, 2, 24781

Step-4: Factors of 49580

List of positive integer factors of 49580 that divides 49562 without a remainder.

1, 2, 4, 5, 10, 20, 37, 67, 74, 134, 148, 185, 268, 335, 370, 670, 740, 1340, 2479, 4958, 9916, 12395, 24790

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49562 and 49580