What is the Greatest Common Factor of 1639 and 1651?

Greatest common factor (GCF) of 1639 and 1651 is 1.

GCF(1639,1651) = 1

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

How to find the GCF of 1639 and 1651?

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

Step-1: Prime Factorization of 1639

Prime factors of 1639 are 11, 149. Prime factorization of 1639 in exponential form is:

1639 = 11¹ × 149¹

Step-2: Prime Factorization of 1651

Prime factors of 1651 are 13, 127. Prime factorization of 1651 in exponential form is:

1651 = 13¹ × 127¹

Step-3: Factors of 1639

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

1, 11, 149

Step-4: Factors of 1651

List of positive integer factors of 1651 that divides 1639 without a remainder.

1, 13, 127

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1639 and 1651