What is the Greatest Common Factor of 67540 and 67558?

Greatest common factor (GCF) of 67540 and 67558 is 2.

GCF(67540,67558) = 2

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

How to find the GCF of 67540 and 67558?

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

Step-1: Prime Factorization of 67540

Prime factors of 67540 are 2, 5, 11, 307. Prime factorization of 67540 in exponential form is:

67540 = 2² × 5¹ × 11¹ × 307¹

Step-2: Prime Factorization of 67558

Prime factors of 67558 are 2, 17, 1987. Prime factorization of 67558 in exponential form is:

67558 = 2¹ × 17¹ × 1987¹

Step-3: Factors of 67540

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

1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 307, 614, 1228, 1535, 3070, 3377, 6140, 6754, 13508, 16885, 33770

Step-4: Factors of 67558

List of positive integer factors of 67558 that divides 67540 without a remainder.

1, 2, 17, 34, 1987, 3974, 33779

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 67540 and 67558