What is the Greatest Common Factor of 47968 and 47982?

Greatest common factor (GCF) of 47968 and 47982 is 2.

GCF(47968,47982) = 2

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

How to find the GCF of 47968 and 47982?

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

Step-1: Prime Factorization of 47968

Prime factors of 47968 are 2, 1499. Prime factorization of 47968 in exponential form is:

47968 = 2⁵ × 1499¹

Step-2: Prime Factorization of 47982

Prime factors of 47982 are 2, 3, 11, 727. Prime factorization of 47982 in exponential form is:

47982 = 2¹ × 3¹ × 11¹ × 727¹

Step-3: Factors of 47968

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

1, 2, 4, 8, 16, 32, 1499, 2998, 5996, 11992, 23984

Step-4: Factors of 47982

List of positive integer factors of 47982 that divides 47968 without a remainder.

1, 2, 3, 6, 11, 22, 33, 66, 727, 1454, 2181, 4362, 7997, 15994, 23991

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47968 and 47982