What is the Greatest Common Factor of 1140 and 1157?

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

GCF(1140,1157) = 1

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

How to find the GCF of 1140 and 1157?

We will first find the prime factorization of 1140 and 1157. After we will calculate the factors of 1140 and 1157 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 1157

Prime factors of 1157 are 13, 89. Prime factorization of 1157 in exponential form is:

1157 = 13¹ × 89¹

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 1157

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

1, 13, 89

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1140 and 1157