What is the Greatest Common Factor of 62480 and 62487?

Greatest common factor (GCF) of 62480 and 62487 is 1.

GCF(62480,62487) = 1

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

How to find the GCF of 62480 and 62487?

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

Step-1: Prime Factorization of 62480

Prime factors of 62480 are 2, 5, 11, 71. Prime factorization of 62480 in exponential form is:

62480 = 2⁴ × 5¹ × 11¹ × 71¹

Step-2: Prime Factorization of 62487

Prime factors of 62487 are 3, 53, 131. Prime factorization of 62487 in exponential form is:

62487 = 3² × 53¹ × 131¹

Step-3: Factors of 62480

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

1, 2, 4, 5, 8, 10, 11, 16, 20, 22, 40, 44, 55, 71, 80, 88, 110, 142, 176, 220, 284, 355, 440, 568, 710, 781, 880, 1136, 1420, 1562, 2840, 3124, 3905, 5680, 6248, 7810, 12496, 15620, 31240

Step-4: Factors of 62487

List of positive integer factors of 62487 that divides 62480 without a remainder.

1, 3, 9, 53, 131, 159, 393, 477, 1179, 6943, 20829

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 62480 and 62487