What is the Greatest Common Factor of 58040 and 58053?

Greatest common factor (GCF) of 58040 and 58053 is 1.

GCF(58040,58053) = 1

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

How to find the GCF of 58040 and 58053?

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

Step-1: Prime Factorization of 58040

Prime factors of 58040 are 2, 5, 1451. Prime factorization of 58040 in exponential form is:

58040 = 2³ × 5¹ × 1451¹

Step-2: Prime Factorization of 58053

Prime factors of 58053 are 3, 37, 523. Prime factorization of 58053 in exponential form is:

58053 = 3¹ × 37¹ × 523¹

Step-3: Factors of 58040

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

1, 2, 4, 5, 8, 10, 20, 40, 1451, 2902, 5804, 7255, 11608, 14510, 29020

Step-4: Factors of 58053

List of positive integer factors of 58053 that divides 58040 without a remainder.

1, 3, 37, 111, 523, 1569, 19351

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 58040 and 58053