What is the Greatest Common Factor of 47946 and 47965?

Greatest common factor (GCF) of 47946 and 47965 is 1.

GCF(47946,47965) = 1

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

How to find the GCF of 47946 and 47965?

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

Step-1: Prime Factorization of 47946

Prime factors of 47946 are 2, 3, 61, 131. Prime factorization of 47946 in exponential form is:

47946 = 2¹ × 3¹ × 61¹ × 131¹

Step-2: Prime Factorization of 47965

Prime factors of 47965 are 5, 53, 181. Prime factorization of 47965 in exponential form is:

47965 = 5¹ × 53¹ × 181¹

Step-3: Factors of 47946

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

1, 2, 3, 6, 61, 122, 131, 183, 262, 366, 393, 786, 7991, 15982, 23973

Step-4: Factors of 47965

List of positive integer factors of 47965 that divides 47946 without a remainder.

1, 5, 53, 181, 265, 905, 9593

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47946 and 47965