What is the Greatest Common Factor of 14690 and 14705?

Greatest common factor (GCF) of 14690 and 14705 is 5.

GCF(14690,14705) = 5

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

How to find the GCF of 14690 and 14705?

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

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

Prime factors of 14705 are 5, 17, 173. Prime factorization of 14705 in exponential form is:

14705 = 5¹ × 17¹ × 173¹

Step-3: Factors of 14690

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

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

Step-4: Factors of 14705

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

1, 5, 17, 85, 173, 865, 2941

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14690 and 14705