What is the Greatest Common Factor of 1141 and 1158?

Greatest common factor (GCF) of 1141 and 1158 is 1.

GCF(1141,1158) = 1

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

How to find the GCF of 1141 and 1158?

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

Step-1: Prime Factorization of 1141

Prime factors of 1141 are 7, 163. Prime factorization of 1141 in exponential form is:

1141 = 7¹ × 163¹

Step-2: Prime Factorization of 1158

Prime factors of 1158 are 2, 3, 193. Prime factorization of 1158 in exponential form is:

1158 = 2¹ × 3¹ × 193¹

Step-3: Factors of 1141

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

1, 7, 163

Step-4: Factors of 1158

List of positive integer factors of 1158 that divides 1141 without a remainder.

1, 2, 3, 6, 193, 386, 579

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1141 and 1158