What is the Greatest Common Factor of 48487 and 48506?

Greatest common factor (GCF) of 48487 and 48506 is 1.

GCF(48487,48506) = 1

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

How to find the GCF of 48487 and 48506?

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

Step-1: Prime Factorization of 48487

Prime factors of 48487 are 48487. Prime factorization of 48487 in exponential form is:

48487 = 48487¹

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

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

Step-4: Factors of 48506

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48487 and 48506