What is the Greatest Common Factor of 11146 and 11158?

Greatest common factor (GCF) of 11146 and 11158 is 2.

GCF(11146,11158) = 2

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

How to find the GCF of 11146 and 11158?

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

Step-1: Prime Factorization of 11146

Prime factors of 11146 are 2, 5573. Prime factorization of 11146 in exponential form is:

11146 = 2¹ × 5573¹

Step-2: Prime Factorization of 11158

Prime factors of 11158 are 2, 7, 797. Prime factorization of 11158 in exponential form is:

11158 = 2¹ × 7¹ × 797¹

Step-3: Factors of 11146

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

1, 2, 5573

Step-4: Factors of 11158

List of positive integer factors of 11158 that divides 11146 without a remainder.

1, 2, 7, 14, 797, 1594, 5579

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11146 and 11158