What is the Greatest Common Factor of 11130 and 11146?

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

GCF(11130,11146) = 2

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

How to find the GCF of 11130 and 11146?

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

Step-1: Prime Factorization of 11130

Prime factors of 11130 are 2, 3, 5, 7, 53. Prime factorization of 11130 in exponential form is:

11130 = 2¹ × 3¹ × 5¹ × 7¹ × 53¹

Step-2: Prime Factorization of 11146

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

11146 = 2¹ × 5573¹

Step-3: Factors of 11130

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

1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 53, 70, 105, 106, 159, 210, 265, 318, 371, 530, 742, 795, 1113, 1590, 1855, 2226, 3710, 5565

Step-4: Factors of 11146

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

1, 2, 5573

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 11130 and 11146