What is the Greatest Common Factor of 14678 and 14690?

Greatest common factor (GCF) of 14678 and 14690 is 2.

GCF(14678,14690) = 2

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

How to find the GCF of 14678 and 14690?

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

Step-1: Prime Factorization of 14678

Prime factors of 14678 are 2, 41, 179. Prime factorization of 14678 in exponential form is:

14678 = 2¹ × 41¹ × 179¹

Step-2: Prime Factorization of 14690

Prime factors of 14690 are 2, 5, 13, 113. Prime factorization of 14690 in exponential form is:

14690 = 2¹ × 5¹ × 13¹ × 113¹

Step-3: Factors of 14678

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

1, 2, 41, 82, 179, 358, 7339

Step-4: Factors of 14690

List of positive integer factors of 14690 that divides 14678 without a remainder.

1, 2, 5, 10, 13, 26, 65, 113, 130, 226, 565, 1130, 1469, 2938, 7345

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 14678 and 14690. The biggest common factor number is the GCF number.
So the greatest common factor 14678 and 14690 is 2.

Also check out the Least Common Multiple of 14678 and 14690