What is the Greatest Common Factor of 58035 and 58048?

Greatest common factor (GCF) of 58035 and 58048 is 1.

GCF(58035,58048) = 1

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

How to find the GCF of 58035 and 58048?

We will first find the prime factorization of 58035 and 58048. After we will calculate the factors of 58035 and 58048 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 58048

Prime factors of 58048 are 2, 907. Prime factorization of 58048 in exponential form is:

58048 = 2⁶ × 907¹

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 58048

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

1, 2, 4, 8, 16, 32, 64, 907, 1814, 3628, 7256, 14512, 29024

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 58035 and 58048