What is the Greatest Common Factor of 1135 and 1148?

Greatest common factor (GCF) of 1135 and 1148 is 1.

GCF(1135,1148) = 1

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

How to find the GCF of 1135 and 1148?

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

Step-1: Prime Factorization of 1135

Prime factors of 1135 are 5, 227. Prime factorization of 1135 in exponential form is:

1135 = 5¹ × 227¹

Step-2: Prime Factorization of 1148

Prime factors of 1148 are 2, 7, 41. Prime factorization of 1148 in exponential form is:

1148 = 2² × 7¹ × 41¹

Step-3: Factors of 1135

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

1, 5, 227

Step-4: Factors of 1148

List of positive integer factors of 1148 that divides 1135 without a remainder.

1, 2, 4, 7, 14, 28, 41, 82, 164, 287, 574

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1135 and 1148