What is the Greatest Common Factor of 1139 and 1150?

Greatest common factor (GCF) of 1139 and 1150 is 1.

GCF(1139,1150) = 1

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

How to find the GCF of 1139 and 1150?

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

Step-1: Prime Factorization of 1139

Prime factors of 1139 are 17, 67. Prime factorization of 1139 in exponential form is:

1139 = 17¹ × 67¹

Step-2: Prime Factorization of 1150

Prime factors of 1150 are 2, 5, 23. Prime factorization of 1150 in exponential form is:

1150 = 2¹ × 5² × 23¹

Step-3: Factors of 1139

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

1, 17, 67

Step-4: Factors of 1150

List of positive integer factors of 1150 that divides 1139 without a remainder.

1, 2, 5, 10, 23, 25, 46, 50, 115, 230, 575

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1139 and 1150