What is the Greatest Common Factor of 48939 and 48946?

Greatest common factor (GCF) of 48939 and 48946 is 1.

GCF(48939,48946) = 1

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

How to find the GCF of 48939 and 48946?

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

Step-1: Prime Factorization of 48939

Prime factors of 48939 are 3, 11, 1483. Prime factorization of 48939 in exponential form is:

48939 = 3¹ × 11¹ × 1483¹

Step-2: Prime Factorization of 48946

Prime factors of 48946 are 2, 24473. Prime factorization of 48946 in exponential form is:

48946 = 2¹ × 24473¹

Step-3: Factors of 48939

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

1, 3, 11, 33, 1483, 4449, 16313

Step-4: Factors of 48946

List of positive integer factors of 48946 that divides 48939 without a remainder.

1, 2, 24473

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 48939 and 48946