What is the Greatest Common Factor of 47968 and 47986?

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

GCF(47968,47986) = 2

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

How to find the GCF of 47968 and 47986?

We will first find the prime factorization of 47968 and 47986. After we will calculate the factors of 47968 and 47986 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 47986

Prime factors of 47986 are 2, 23993. Prime factorization of 47986 in exponential form is:

47986 = 2¹ × 23993¹

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 47986

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

1, 2, 23993

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47968 and 47986