What is the Greatest Common Factor of 47932 and 47938?

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

GCF(47932,47938) = 2

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

How to find the GCF of 47932 and 47938?

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

Step-1: Prime Factorization of 47932

Prime factors of 47932 are 2, 23, 521. Prime factorization of 47932 in exponential form is:

47932 = 2² × 23¹ × 521¹

Step-2: 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-3: Factors of 47932

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

1, 2, 4, 23, 46, 92, 521, 1042, 2084, 11983, 23966

Step-4: Factors of 47938

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47932 and 47938