What is the Greatest Common Factor of 11147 and 11160?

Greatest common factor (GCF) of 11147 and 11160 is 1.

GCF(11147,11160) = 1

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

How to find the GCF of 11147 and 11160?

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

Step-1: Prime Factorization of 11147

Prime factors of 11147 are 71, 157. Prime factorization of 11147 in exponential form is:

11147 = 71¹ × 157¹

Step-2: Prime Factorization of 11160

Prime factors of 11160 are 2, 3, 5, 31. Prime factorization of 11160 in exponential form is:

11160 = 2³ × 3² × 5¹ × 31¹

Step-3: Factors of 11147

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

1, 71, 157

Step-4: Factors of 11160

List of positive integer factors of 11160 that divides 11147 without a remainder.

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 31, 36, 40, 45, 60, 62, 72, 90, 93, 120, 124, 155, 180, 186, 248, 279, 310, 360, 372, 465, 558, 620, 744, 930, 1116, 1240, 1395, 1860, 2232, 2790, 3720, 5580

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 11147 and 11160. The biggest common factor number is the GCF number.
So the greatest common factor 11147 and 11160 is 1.

Also check out the Least Common Multiple of 11147 and 11160