What is the Greatest Common Factor of 13160 and 13169?

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

GCF(13160,13169) = 1

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

How to find the GCF of 13160 and 13169?

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

Step-1: 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-2: Prime Factorization of 13169

Prime factors of 13169 are 13, 1013. Prime factorization of 13169 in exponential form is:

13169 = 13¹ × 1013¹

Step-3: Factors of 13160

List of positive integer factors of 13160 that divides 13160 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

Step-4: Factors of 13169

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

1, 13, 1013

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13160 and 13169