What is the Greatest Common Factor of 58052 and 58065?

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

GCF(58052,58065) = 1

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

How to find the GCF of 58052 and 58065?

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

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

Prime factors of 58065 are 3, 5, 7, 79. Prime factorization of 58065 in exponential form is:

58065 = 3¹ × 5¹ × 7² × 79¹

Step-3: Factors of 58052

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

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

Step-4: Factors of 58065

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

1, 3, 5, 7, 15, 21, 35, 49, 79, 105, 147, 237, 245, 395, 553, 735, 1185, 1659, 2765, 3871, 8295, 11613, 19355

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 58052 and 58065