What is the Greatest Common Factor of 47968 and 47983?

Greatest common factor (GCF) of 47968 and 47983 is 1.

GCF(47968,47983) = 1

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

How to find the GCF of 47968 and 47983?

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

Prime factors of 47983 are 13, 3691. Prime factorization of 47983 in exponential form is:

47983 = 13¹ × 3691¹

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 47983

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

1, 13, 3691

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47968 and 47983