What is the Greatest Common Factor of 47959 and 47964?

Greatest common factor (GCF) of 47959 and 47964 is 1.

GCF(47959,47964) = 1

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

How to find the GCF of 47959 and 47964?

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

Step-1: Prime Factorization of 47959

Prime factors of 47959 are 199, 241. Prime factorization of 47959 in exponential form is:

47959 = 199¹ × 241¹

Step-2: Prime Factorization of 47964

Prime factors of 47964 are 2, 3, 7, 571. Prime factorization of 47964 in exponential form is:

47964 = 2² × 3¹ × 7¹ × 571¹

Step-3: Factors of 47959

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

1, 199, 241

Step-4: Factors of 47964

List of positive integer factors of 47964 that divides 47959 without a remainder.

1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 571, 1142, 1713, 2284, 3426, 3997, 6852, 7994, 11991, 15988, 23982

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47959 and 47964