What is the Greatest Common Factor of 58053 and 58068?

Greatest common factor (GCF) of 58053 and 58068 is 3.

GCF(58053,58068) = 3

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

How to find the GCF of 58053 and 58068?

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

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

Prime factors of 58068 are 2, 3, 1613. Prime factorization of 58068 in exponential form is:

58068 = 2² × 3² × 1613¹

Step-3: Factors of 58053

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

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

Step-4: Factors of 58068

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

1, 2, 3, 4, 6, 9, 12, 18, 36, 1613, 3226, 4839, 6452, 9678, 14517, 19356, 29034

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 58053 and 58068