What is the Greatest Common Factor of 16840 and 16851?

Greatest common factor (GCF) of 16840 and 16851 is 1.

GCF(16840,16851) = 1

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

How to find the GCF of 16840 and 16851?

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

Step-1: Prime Factorization of 16840

Prime factors of 16840 are 2, 5, 421. Prime factorization of 16840 in exponential form is:

16840 = 2³ × 5¹ × 421¹

Step-2: Prime Factorization of 16851

Prime factors of 16851 are 3, 41, 137. Prime factorization of 16851 in exponential form is:

16851 = 3¹ × 41¹ × 137¹

Step-3: Factors of 16840

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

1, 2, 4, 5, 8, 10, 20, 40, 421, 842, 1684, 2105, 3368, 4210, 8420

Step-4: Factors of 16851

List of positive integer factors of 16851 that divides 16840 without a remainder.

1, 3, 41, 123, 137, 411, 5617

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16840 and 16851