What is the Greatest Common Factor of 58047 and 58052?

Greatest common factor (GCF) of 58047 and 58052 is 1.

GCF(58047,58052) = 1

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

How to find the GCF of 58047 and 58052?

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

Step-1: Prime Factorization of 58047

Prime factors of 58047 are 3, 11, 1759. Prime factorization of 58047 in exponential form is:

58047 = 3¹ × 11¹ × 1759¹

Step-2: Prime Factorization of 58052

Prime factors of 58052 are 2, 23, 631. Prime factorization of 58052 in exponential form is:

58052 = 2² × 23¹ × 631¹

Step-3: Factors of 58047

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

1, 3, 11, 33, 1759, 5277, 19349

Step-4: Factors of 58052

List of positive integer factors of 58052 that divides 58047 without a remainder.

1, 2, 4, 23, 46, 92, 631, 1262, 2524, 14513, 29026

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 58047 and 58052