What is the Greatest Common Factor of 14959 and 14964?

Greatest common factor (GCF) of 14959 and 14964 is 1.

GCF(14959,14964) = 1

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

How to find the GCF of 14959 and 14964?

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

Step-1: Prime Factorization of 14959

Prime factors of 14959 are 7, 2137. Prime factorization of 14959 in exponential form is:

14959 = 7¹ × 2137¹

Step-2: Prime Factorization of 14964

Prime factors of 14964 are 2, 3, 29, 43. Prime factorization of 14964 in exponential form is:

14964 = 2² × 3¹ × 29¹ × 43¹

Step-3: Factors of 14959

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

1, 7, 2137

Step-4: Factors of 14964

List of positive integer factors of 14964 that divides 14959 without a remainder.

1, 2, 3, 4, 6, 12, 29, 43, 58, 86, 87, 116, 129, 172, 174, 258, 348, 516, 1247, 2494, 3741, 4988, 7482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14959 and 14964