What is the Greatest Common Factor of 28487 and 28496?

Greatest common factor (GCF) of 28487 and 28496 is 1.

GCF(28487,28496) = 1

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

How to find the GCF of 28487 and 28496?

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

Step-1: Prime Factorization of 28487

Prime factors of 28487 are 61, 467. Prime factorization of 28487 in exponential form is:

28487 = 61¹ × 467¹

Step-2: Prime Factorization of 28496

Prime factors of 28496 are 2, 13, 137. Prime factorization of 28496 in exponential form is:

28496 = 2⁴ × 13¹ × 137¹

Step-3: Factors of 28487

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

1, 61, 467

Step-4: Factors of 28496

List of positive integer factors of 28496 that divides 28487 without a remainder.

1, 2, 4, 8, 13, 16, 26, 52, 104, 137, 208, 274, 548, 1096, 1781, 2192, 3562, 7124, 14248

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 28487 and 28496