What is the Greatest Common Factor of 14958 and 14962?

Greatest common factor (GCF) of 14958 and 14962 is 2.

GCF(14958,14962) = 2

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

How to find the GCF of 14958 and 14962?

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

Step-1: Prime Factorization of 14958

Prime factors of 14958 are 2, 3, 277. Prime factorization of 14958 in exponential form is:

14958 = 2¹ × 3³ × 277¹

Step-2: Prime Factorization of 14962

Prime factors of 14962 are 2, 7481. Prime factorization of 14962 in exponential form is:

14962 = 2¹ × 7481¹

Step-3: Factors of 14958

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

1, 2, 3, 6, 9, 18, 27, 54, 277, 554, 831, 1662, 2493, 4986, 7479

Step-4: Factors of 14962

List of positive integer factors of 14962 that divides 14958 without a remainder.

1, 2, 7481

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14958 and 14962