What is the Greatest Common Factor of 62662 and 62680?

Greatest common factor (GCF) of 62662 and 62680 is 2.

GCF(62662,62680) = 2

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

How to find the GCF of 62662 and 62680?

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

Step-1: Prime Factorization of 62662

Prime factors of 62662 are 2, 17, 19, 97. Prime factorization of 62662 in exponential form is:

62662 = 2¹ × 17¹ × 19¹ × 97¹

Step-2: Prime Factorization of 62680

Prime factors of 62680 are 2, 5, 1567. Prime factorization of 62680 in exponential form is:

62680 = 2³ × 5¹ × 1567¹

Step-3: Factors of 62662

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

1, 2, 17, 19, 34, 38, 97, 194, 323, 646, 1649, 1843, 3298, 3686, 31331

Step-4: Factors of 62680

List of positive integer factors of 62680 that divides 62662 without a remainder.

1, 2, 4, 5, 8, 10, 20, 40, 1567, 3134, 6268, 7835, 12536, 15670, 31340

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 62662 and 62680