What is the Greatest Common Factor of 1148 and 1167?

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

GCF(1148,1167) = 1

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

How to find the GCF of 1148 and 1167?

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

Step-1: 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-2: Prime Factorization of 1167

Prime factors of 1167 are 3, 389. Prime factorization of 1167 in exponential form is:

1167 = 3¹ × 389¹

Step-3: Factors of 1148

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

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

Step-4: Factors of 1167

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

1, 3, 389

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1148 and 1167