What is the Greatest Common Factor of 13040 and 13058?

Greatest common factor (GCF) of 13040 and 13058 is 2.

GCF(13040,13058) = 2

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

How to find the GCF of 13040 and 13058?

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

Step-1: Prime Factorization of 13040

Prime factors of 13040 are 2, 5, 163. Prime factorization of 13040 in exponential form is:

13040 = 2⁴ × 5¹ × 163¹

Step-2: Prime Factorization of 13058

Prime factors of 13058 are 2, 6529. Prime factorization of 13058 in exponential form is:

13058 = 2¹ × 6529¹

Step-3: Factors of 13040

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

1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 163, 326, 652, 815, 1304, 1630, 2608, 3260, 6520

Step-4: Factors of 13058

List of positive integer factors of 13058 that divides 13040 without a remainder.

1, 2, 6529

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 13040 and 13058. The biggest common factor number is the GCF number.
So the greatest common factor 13040 and 13058 is 2.

Also check out the Least Common Multiple of 13040 and 13058