What is the Greatest Common Factor of 16939 and 16948?

Greatest common factor (GCF) of 16939 and 16948 is 1.

GCF(16939,16948) = 1

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

How to find the GCF of 16939 and 16948?

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

Step-1: Prime Factorization of 16939

Prime factors of 16939 are 13, 1303. Prime factorization of 16939 in exponential form is:

16939 = 13¹ × 1303¹

Step-2: Prime Factorization of 16948

Prime factors of 16948 are 2, 19, 223. Prime factorization of 16948 in exponential form is:

16948 = 2² × 19¹ × 223¹

Step-3: Factors of 16939

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

1, 13, 1303

Step-4: Factors of 16948

List of positive integer factors of 16948 that divides 16939 without a remainder.

1, 2, 4, 19, 38, 76, 223, 446, 892, 4237, 8474

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16939 and 16948