What is the Greatest Common Factor of 1147 and 1164?

Greatest common factor (GCF) of 1147 and 1164 is 1.

GCF(1147,1164) = 1

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

How to find the GCF of 1147 and 1164?

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

Step-1: Prime Factorization of 1147

Prime factors of 1147 are 31, 37. Prime factorization of 1147 in exponential form is:

1147 = 31¹ × 37¹

Step-2: Prime Factorization of 1164

Prime factors of 1164 are 2, 3, 97. Prime factorization of 1164 in exponential form is:

1164 = 2² × 3¹ × 97¹

Step-3: Factors of 1147

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

1, 31, 37

Step-4: Factors of 1164

List of positive integer factors of 1164 that divides 1147 without a remainder.

1, 2, 3, 4, 6, 12, 97, 194, 291, 388, 582

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1147 and 1164