What is the Greatest Common Factor of 16958 and 16962?

Greatest common factor (GCF) of 16958 and 16962 is 2.

GCF(16958,16962) = 2

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

How to find the GCF of 16958 and 16962?

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

Step-1: Prime Factorization of 16958

Prime factors of 16958 are 2, 61, 139. Prime factorization of 16958 in exponential form is:

16958 = 2¹ × 61¹ × 139¹

Step-2: Prime Factorization of 16962

Prime factors of 16962 are 2, 3, 11, 257. Prime factorization of 16962 in exponential form is:

16962 = 2¹ × 3¹ × 11¹ × 257¹

Step-3: Factors of 16958

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

1, 2, 61, 122, 139, 278, 8479

Step-4: Factors of 16962

List of positive integer factors of 16962 that divides 16958 without a remainder.

1, 2, 3, 6, 11, 22, 33, 66, 257, 514, 771, 1542, 2827, 5654, 8481

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16958 and 16962