What is the Greatest Common Factor of 47950 and 47958?

Greatest common factor (GCF) of 47950 and 47958 is 2.

GCF(47950,47958) = 2

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

How to find the GCF of 47950 and 47958?

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

Step-1: Prime Factorization of 47950

Prime factors of 47950 are 2, 5, 7, 137. Prime factorization of 47950 in exponential form is:

47950 = 2¹ × 5² × 7¹ × 137¹

Step-2: Prime Factorization of 47958

Prime factors of 47958 are 2, 3, 7993. Prime factorization of 47958 in exponential form is:

47958 = 2¹ × 3¹ × 7993¹

Step-3: Factors of 47950

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

1, 2, 5, 7, 10, 14, 25, 35, 50, 70, 137, 175, 274, 350, 685, 959, 1370, 1918, 3425, 4795, 6850, 9590, 23975

Step-4: Factors of 47958

List of positive integer factors of 47958 that divides 47950 without a remainder.

1, 2, 3, 6, 7993, 15986, 23979

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47950 and 47958