What is the Greatest Common Factor of 16851 and 16862?

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

GCF(16851,16862) = 1

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

How to find the GCF of 16851 and 16862?

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

Step-1: 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-2: Prime Factorization of 16862

Prime factors of 16862 are 2, 8431. Prime factorization of 16862 in exponential form is:

16862 = 2¹ × 8431¹

Step-3: Factors of 16851

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

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

Step-4: Factors of 16862

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

1, 2, 8431

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 16851 and 16862