What is the Greatest Common Factor of 48948 and 48959?

Greatest common factor (GCF) of 48948 and 48959 is 1.

GCF(48948,48959) = 1

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

How to find the GCF of 48948 and 48959?

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

Step-1: Prime Factorization of 48948

Prime factors of 48948 are 2, 3, 4079. Prime factorization of 48948 in exponential form is:

48948 = 2² × 3¹ × 4079¹

Step-2: Prime Factorization of 48959

Prime factors of 48959 are 173, 283. Prime factorization of 48959 in exponential form is:

48959 = 173¹ × 283¹

Step-3: Factors of 48948

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

1, 2, 3, 4, 6, 12, 4079, 8158, 12237, 16316, 24474

Step-4: Factors of 48959

List of positive integer factors of 48959 that divides 48948 without a remainder.

1, 173, 283

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48948 and 48959