What is the Greatest Common Factor of 9152 and 9161?

Greatest common factor (GCF) of 9152 and 9161 is 1.

GCF(9152,9161) = 1

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

How to find the GCF of 9152 and 9161?

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

Step-1: Prime Factorization of 9152

Prime factors of 9152 are 2, 11, 13. Prime factorization of 9152 in exponential form is:

9152 = 2⁶ × 11¹ × 13¹

Step-2: Prime Factorization of 9161

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

9161 = 9161¹

Step-3: Factors of 9152

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

1, 2, 4, 8, 11, 13, 16, 22, 26, 32, 44, 52, 64, 88, 104, 143, 176, 208, 286, 352, 416, 572, 704, 832, 1144, 2288, 4576

Step-4: Factors of 9161

List of positive integer factors of 9161 that divides 9152 without a remainder.

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 9152 and 9161