What is the Greatest Common Factor of 58035 and 58047?

Greatest common factor (GCF) of 58035 and 58047 is 3.

GCF(58035,58047) = 3

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

How to find the GCF of 58035 and 58047?

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

Step-1: Prime Factorization of 58035

Prime factors of 58035 are 3, 5, 53, 73. Prime factorization of 58035 in exponential form is:

58035 = 3¹ × 5¹ × 53¹ × 73¹

Step-2: 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-3: Factors of 58035

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

1, 3, 5, 15, 53, 73, 159, 219, 265, 365, 795, 1095, 3869, 11607, 19345

Step-4: Factors of 58047

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 58035 and 58047