What is the Greatest Common Factor of 1639 and 1652?

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

GCF(1639,1652) = 1

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

How to find the GCF of 1639 and 1652?

We will first find the prime factorization of 1639 and 1652. After we will calculate the factors of 1639 and 1652 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 1652

Prime factors of 1652 are 2, 7, 59. Prime factorization of 1652 in exponential form is:

1652 = 2² × 7¹ × 59¹

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 1652

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

1, 2, 4, 7, 14, 28, 59, 118, 236, 413, 826

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1639 and 1652