What is the Greatest Common Factor of 47938 and 47948?

Greatest common factor (GCF) of 47938 and 47948 is 2.

GCF(47938,47948) = 2

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

How to find the GCF of 47938 and 47948?

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

Step-1: Prime Factorization of 47938

Prime factors of 47938 are 2, 11, 2179. Prime factorization of 47938 in exponential form is:

47938 = 2¹ × 11¹ × 2179¹

Step-2: Prime Factorization of 47948

Prime factors of 47948 are 2, 11987. Prime factorization of 47948 in exponential form is:

47948 = 2² × 11987¹

Step-3: Factors of 47938

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

1, 2, 11, 22, 2179, 4358, 23969

Step-4: Factors of 47948

List of positive integer factors of 47948 that divides 47938 without a remainder.

1, 2, 4, 11987, 23974

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 47938 and 47948. The biggest common factor number is the GCF number.
So the greatest common factor 47938 and 47948 is 2.

Also check out the Least Common Multiple of 47938 and 47948