What is the Greatest Common Factor of 16952 and 16958?

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

GCF(16952,16958) = 2

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

How to find the GCF of 16952 and 16958?

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

Step-1: Prime Factorization of 16952

Prime factors of 16952 are 2, 13, 163. Prime factorization of 16952 in exponential form is:

16952 = 2³ × 13¹ × 163¹

Step-2: 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-3: Factors of 16952

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

1, 2, 4, 8, 13, 26, 52, 104, 163, 326, 652, 1304, 2119, 4238, 8476

Step-4: Factors of 16958

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16952 and 16958