What is the Greatest Common Factor of 1140 and 1147?

Greatest common factor (GCF) of 1140 and 1147 is 1.

GCF(1140,1147) = 1

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

How to find the GCF of 1140 and 1147?

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

Step-1: Prime Factorization of 1140

Prime factors of 1140 are 2, 3, 5, 19. Prime factorization of 1140 in exponential form is:

1140 = 2² × 3¹ × 5¹ × 19¹

Step-2: Prime Factorization of 1147

Prime factors of 1147 are 31, 37. Prime factorization of 1147 in exponential form is:

1147 = 31¹ × 37¹

Step-3: Factors of 1140

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

1, 2, 3, 4, 5, 6, 10, 12, 15, 19, 20, 30, 38, 57, 60, 76, 95, 114, 190, 228, 285, 380, 570

Step-4: Factors of 1147

List of positive integer factors of 1147 that divides 1140 without a remainder.

1, 31, 37

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1140 and 1147