What is the Greatest Common Factor of 48540 and 48558?

Greatest common factor (GCF) of 48540 and 48558 is 6.

GCF(48540,48558) = 6

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

How to find the GCF of 48540 and 48558?

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

Step-1: Prime Factorization of 48540

Prime factors of 48540 are 2, 3, 5, 809. Prime factorization of 48540 in exponential form is:

48540 = 2² × 3¹ × 5¹ × 809¹

Step-2: Prime Factorization of 48558

Prime factors of 48558 are 2, 3, 8093. Prime factorization of 48558 in exponential form is:

48558 = 2¹ × 3¹ × 8093¹

Step-3: Factors of 48540

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

1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 809, 1618, 2427, 3236, 4045, 4854, 8090, 9708, 12135, 16180, 24270

Step-4: Factors of 48558

List of positive integer factors of 48558 that divides 48540 without a remainder.

1, 2, 3, 6, 8093, 16186, 24279

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 48540 and 48558. The biggest common factor number is the GCF number.
So the greatest common factor 48540 and 48558 is 6.

Also check out the Least Common Multiple of 48540 and 48558