What is the Greatest Common Factor of 13147 and 13160?

Greatest common factor (GCF) of 13147 and 13160 is 1.

GCF(13147,13160) = 1

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

How to find the GCF of 13147 and 13160?

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

Step-1: Prime Factorization of 13147

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

13147 = 13147¹

Step-2: Prime Factorization of 13160

Prime factors of 13160 are 2, 5, 7, 47. Prime factorization of 13160 in exponential form is:

13160 = 2³ × 5¹ × 7¹ × 47¹

Step-3: Factors of 13147

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

Step-4: Factors of 13160

List of positive integer factors of 13160 that divides 13147 without a remainder.

1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 47, 56, 70, 94, 140, 188, 235, 280, 329, 376, 470, 658, 940, 1316, 1645, 1880, 2632, 3290, 6580

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13147 and 13160