What is the Greatest Common Factor of 11536 and 11540?

Greatest common factor (GCF) of 11536 and 11540 is 4.

GCF(11536,11540) = 4

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

How to find the GCF of 11536 and 11540?

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

Step-1: Prime Factorization of 11536

Prime factors of 11536 are 2, 7, 103. Prime factorization of 11536 in exponential form is:

11536 = 2⁴ × 7¹ × 103¹

Step-2: 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-3: Factors of 11536

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

1, 2, 4, 7, 8, 14, 16, 28, 56, 103, 112, 206, 412, 721, 824, 1442, 1648, 2884, 5768

Step-4: Factors of 11540

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11536 and 11540