What is the Greatest Common Factor of 1168 and 1179?

Greatest common factor (GCF) of 1168 and 1179 is 1.

GCF(1168,1179) = 1

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

How to find the GCF of 1168 and 1179?

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

Step-1: Prime Factorization of 1168

Prime factors of 1168 are 2, 73. Prime factorization of 1168 in exponential form is:

1168 = 2⁴ × 73¹

Step-2: Prime Factorization of 1179

Prime factors of 1179 are 3, 131. Prime factorization of 1179 in exponential form is:

1179 = 3² × 131¹

Step-3: Factors of 1168

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

1, 2, 4, 8, 16, 73, 146, 292, 584

Step-4: Factors of 1179

List of positive integer factors of 1179 that divides 1168 without a remainder.

1, 3, 9, 131, 393

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1168 and 1179