What is the Greatest Common Factor of 15147 and 15158?

Greatest common factor (GCF) of 15147 and 15158 is 11.

GCF(15147,15158) = 11

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

How to find the GCF of 15147 and 15158?

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

Step-1: Prime Factorization of 15147

Prime factors of 15147 are 3, 11, 17. Prime factorization of 15147 in exponential form is:

15147 = 3⁴ × 11¹ × 17¹

Step-2: Prime Factorization of 15158

Prime factors of 15158 are 2, 11, 13, 53. Prime factorization of 15158 in exponential form is:

15158 = 2¹ × 11¹ × 13¹ × 53¹

Step-3: Factors of 15147

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

1, 3, 9, 11, 17, 27, 33, 51, 81, 99, 153, 187, 297, 459, 561, 891, 1377, 1683, 5049

Step-4: Factors of 15158

List of positive integer factors of 15158 that divides 15147 without a remainder.

1, 2, 11, 13, 22, 26, 53, 106, 143, 286, 583, 689, 1166, 1378, 7579

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 15147 and 15158. The biggest common factor number is the GCF number.
So the greatest common factor 15147 and 15158 is 11.

Also check out the Least Common Multiple of 15147 and 15158