What is the Greatest Common Factor of 48961 and 48978?

Greatest common factor (GCF) of 48961 and 48978 is 1.

GCF(48961,48978) = 1

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

How to find the GCF of 48961 and 48978?

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

Step-1: Prime Factorization of 48961

Prime factors of 48961 are 11, 4451. Prime factorization of 48961 in exponential form is:

48961 = 11¹ × 4451¹

Step-2: Prime Factorization of 48978

Prime factors of 48978 are 2, 3, 907. Prime factorization of 48978 in exponential form is:

48978 = 2¹ × 3³ × 907¹

Step-3: Factors of 48961

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

1, 11, 4451

Step-4: Factors of 48978

List of positive integer factors of 48978 that divides 48961 without a remainder.

1, 2, 3, 6, 9, 18, 27, 54, 907, 1814, 2721, 5442, 8163, 16326, 24489

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48961 and 48978