What is the Greatest Common Factor of 47958 and 47962?

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

GCF(47958,47962) = 2

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

How to find the GCF of 47958 and 47962?

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

Step-1: 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-2: Prime Factorization of 47962

Prime factors of 47962 are 2, 23981. Prime factorization of 47962 in exponential form is:

47962 = 2¹ × 23981¹

Step-3: Factors of 47958

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

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

Step-4: Factors of 47962

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

1, 2, 23981

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47958 and 47962