What is the Greatest Common Factor of 47963 and 47968?

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

GCF(47963,47968) = 1

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

How to find the GCF of 47963 and 47968?

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

Step-1: Prime Factorization of 47963

Prime factors of 47963 are 47963. Prime factorization of 47963 in exponential form is:

47963 = 47963¹

Step-2: Prime Factorization of 47968

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

47968 = 2⁵ × 1499¹

Step-3: Factors of 47963

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

Step-4: Factors of 47968

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47963 and 47968