What is the Greatest Common Factor of 48536 and 48540?

Greatest common factor (GCF) of 48536 and 48540 is 4.

GCF(48536,48540) = 4

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

How to find the GCF of 48536 and 48540?

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

Step-1: Prime Factorization of 48536

Prime factors of 48536 are 2, 6067. Prime factorization of 48536 in exponential form is:

48536 = 2³ × 6067¹

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

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

1, 2, 4, 8, 6067, 12134, 24268

Step-4: Factors of 48540

List of positive integer factors of 48540 that divides 48536 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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48536 and 48540