What is the Greatest Common Factor of 9147 and 9160?

Greatest common factor (GCF) of 9147 and 9160 is 1.

GCF(9147,9160) = 1

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

How to find the GCF of 9147 and 9160?

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

Step-1: Prime Factorization of 9147

Prime factors of 9147 are 3, 3049. Prime factorization of 9147 in exponential form is:

9147 = 3¹ × 3049¹

Step-2: Prime Factorization of 9160

Prime factors of 9160 are 2, 5, 229. Prime factorization of 9160 in exponential form is:

9160 = 2³ × 5¹ × 229¹

Step-3: Factors of 9147

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

1, 3, 3049

Step-4: Factors of 9160

List of positive integer factors of 9160 that divides 9147 without a remainder.

1, 2, 4, 5, 8, 10, 20, 40, 229, 458, 916, 1145, 1832, 2290, 4580

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 9147 and 9160