What is the Greatest Common Factor of 1152 and 1165?

Greatest common factor (GCF) of 1152 and 1165 is 1.

GCF(1152,1165) = 1

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

How to find the GCF of 1152 and 1165?

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

Step-1: Prime Factorization of 1152

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

1152 = 2⁷ × 3²

Step-2: Prime Factorization of 1165

Prime factors of 1165 are 5, 233. Prime factorization of 1165 in exponential form is:

1165 = 5¹ × 233¹

Step-3: Factors of 1152

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

1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 64, 72, 96, 128, 144, 192, 288, 384, 576

Step-4: Factors of 1165

List of positive integer factors of 1165 that divides 1152 without a remainder.

1, 5, 233

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1152 and 1165