What is the Greatest Common Factor of 1153 and 1169?

Greatest common factor (GCF) of 1153 and 1169 is 1.

GCF(1153,1169) = 1

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

How to find the GCF of 1153 and 1169?

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

Step-1: Prime Factorization of 1153

Prime factors of 1153 are 1153. Prime factorization of 1153 in exponential form is:

1153 = 1153¹

Step-2: Prime Factorization of 1169

Prime factors of 1169 are 7, 167. Prime factorization of 1169 in exponential form is:

1169 = 7¹ × 167¹

Step-3: Factors of 1153

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

Step-4: Factors of 1169

List of positive integer factors of 1169 that divides 1153 without a remainder.

1, 7, 167

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1153 and 1169