What is the Greatest Common Factor of 48506 and 48512?

Greatest common factor (GCF) of 48506 and 48512 is 2.

GCF(48506,48512) = 2

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

How to find the GCF of 48506 and 48512?

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

Step-1: Prime Factorization of 48506

Prime factors of 48506 are 2, 79, 307. Prime factorization of 48506 in exponential form is:

48506 = 2¹ × 79¹ × 307¹

Step-2: Prime Factorization of 48512

Prime factors of 48512 are 2, 379. Prime factorization of 48512 in exponential form is:

48512 = 2⁷ × 379¹

Step-3: Factors of 48506

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

1, 2, 79, 158, 307, 614, 24253

Step-4: Factors of 48512

List of positive integer factors of 48512 that divides 48506 without a remainder.

1, 2, 4, 8, 16, 32, 64, 128, 379, 758, 1516, 3032, 6064, 12128, 24256

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 48506 and 48512. The biggest common factor number is the GCF number.
So the greatest common factor 48506 and 48512 is 2.

Also check out the Least Common Multiple of 48506 and 48512