What is the Greatest Common Factor of 11540 and 11558?

Greatest common factor (GCF) of 11540 and 11558 is 2.

GCF(11540,11558) = 2

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

How to find the GCF of 11540 and 11558?

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

Step-1: Prime Factorization of 11540

Prime factors of 11540 are 2, 5, 577. Prime factorization of 11540 in exponential form is:

11540 = 2² × 5¹ × 577¹

Step-2: Prime Factorization of 11558

Prime factors of 11558 are 2, 5779. Prime factorization of 11558 in exponential form is:

11558 = 2¹ × 5779¹

Step-3: Factors of 11540

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

1, 2, 4, 5, 10, 20, 577, 1154, 2308, 2885, 5770

Step-4: Factors of 11558

List of positive integer factors of 11558 that divides 11540 without a remainder.

1, 2, 5779

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11540 and 11558