What is the Greatest Common Factor of 14965 and 14978?

Greatest common factor (GCF) of 14965 and 14978 is 1.

GCF(14965,14978) = 1

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

How to find the GCF of 14965 and 14978?

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

Step-1: Prime Factorization of 14965

Prime factors of 14965 are 5, 41, 73. Prime factorization of 14965 in exponential form is:

14965 = 5¹ × 41¹ × 73¹

Step-2: Prime Factorization of 14978

Prime factors of 14978 are 2, 7489. Prime factorization of 14978 in exponential form is:

14978 = 2¹ × 7489¹

Step-3: Factors of 14965

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

1, 5, 41, 73, 205, 365, 2993

Step-4: Factors of 14978

List of positive integer factors of 14978 that divides 14965 without a remainder.

1, 2, 7489

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14965 and 14978