What is the Greatest Common Factor of 15662 and 15680?

Greatest common factor (GCF) of 15662 and 15680 is 2.

GCF(15662,15680) = 2

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

How to find the GCF of 15662 and 15680?

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

Step-1: Prime Factorization of 15662

Prime factors of 15662 are 2, 41, 191. Prime factorization of 15662 in exponential form is:

15662 = 2¹ × 41¹ × 191¹

Step-2: Prime Factorization of 15680

Prime factors of 15680 are 2, 5, 7. Prime factorization of 15680 in exponential form is:

15680 = 2⁶ × 5¹ × 7²

Step-3: Factors of 15662

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

1, 2, 41, 82, 191, 382, 7831

Step-4: Factors of 15680

List of positive integer factors of 15680 that divides 15662 without a remainder.

1, 2, 4, 5, 7, 8, 10, 14, 16, 20, 28, 32, 35, 40, 49, 56, 64, 70, 80, 98, 112, 140, 160, 196, 224, 245, 280, 320, 392, 448, 490, 560, 784, 980, 1120, 1568, 1960, 2240, 3136, 3920, 7840

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15662 and 15680