What is the Greatest Common Factor of 15040 and 15059?

Greatest common factor (GCF) of 15040 and 15059 is 1.

GCF(15040,15059) = 1

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

How to find the GCF of 15040 and 15059?

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

Step-1: Prime Factorization of 15040

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

15040 = 2⁶ × 5¹ × 47¹

Step-2: Prime Factorization of 15059

Prime factors of 15059 are 11, 37. Prime factorization of 15059 in exponential form is:

15059 = 11¹ × 37²

Step-3: Factors of 15040

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

1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 47, 64, 80, 94, 160, 188, 235, 320, 376, 470, 752, 940, 1504, 1880, 3008, 3760, 7520

Step-4: Factors of 15059

List of positive integer factors of 15059 that divides 15040 without a remainder.

1, 11, 37, 407, 1369

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15040 and 15059