What is the Greatest Common Factor of 47961 and 47966?

Greatest common factor (GCF) of 47961 and 47966 is 1.

GCF(47961,47966) = 1

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

How to find the GCF of 47961 and 47966?

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

Step-1: Prime Factorization of 47961

Prime factors of 47961 are 3, 73. Prime factorization of 47961 in exponential form is:

47961 = 3² × 73²

Step-2: Prime Factorization of 47966

Prime factors of 47966 are 2, 29, 827. Prime factorization of 47966 in exponential form is:

47966 = 2¹ × 29¹ × 827¹

Step-3: Factors of 47961

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

1, 3, 9, 73, 219, 657, 5329, 15987

Step-4: Factors of 47966

List of positive integer factors of 47966 that divides 47961 without a remainder.

1, 2, 29, 58, 827, 1654, 23983

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47961 and 47966