What is the Greatest Common Factor of 49935 and 49948?

Greatest common factor (GCF) of 49935 and 49948 is 1.

GCF(49935,49948) = 1

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

How to find the GCF of 49935 and 49948?

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

Step-1: Prime Factorization of 49935

Prime factors of 49935 are 3, 5, 3329. Prime factorization of 49935 in exponential form is:

49935 = 3¹ × 5¹ × 3329¹

Step-2: Prime Factorization of 49948

Prime factors of 49948 are 2, 12487. Prime factorization of 49948 in exponential form is:

49948 = 2² × 12487¹

Step-3: Factors of 49935

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

1, 3, 5, 15, 3329, 9987, 16645

Step-4: Factors of 49948

List of positive integer factors of 49948 that divides 49935 without a remainder.

1, 2, 4, 12487, 24974

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 49935 and 49948