What is the Greatest Common Factor of 47965 and 47978?

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

GCF(47965,47978) = 1

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

How to find the GCF of 47965 and 47978?

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

Step-1: 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-2: Prime Factorization of 47978

Prime factors of 47978 are 2, 7, 23, 149. Prime factorization of 47978 in exponential form is:

47978 = 2¹ × 7¹ × 23¹ × 149¹

Step-3: Factors of 47965

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

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

Step-4: Factors of 47978

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

1, 2, 7, 14, 23, 46, 149, 161, 298, 322, 1043, 2086, 3427, 6854, 23989

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 47965 and 47978