What is the Greatest Common Factor of 1668 and 1679?

Greatest common factor (GCF) of 1668 and 1679 is 1.

GCF(1668,1679) = 1

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

How to find the GCF of 1668 and 1679?

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

Step-1: Prime Factorization of 1668

Prime factors of 1668 are 2, 3, 139. Prime factorization of 1668 in exponential form is:

1668 = 2² × 3¹ × 139¹

Step-2: Prime Factorization of 1679

Prime factors of 1679 are 23, 73. Prime factorization of 1679 in exponential form is:

1679 = 23¹ × 73¹

Step-3: Factors of 1668

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

1, 2, 3, 4, 6, 12, 139, 278, 417, 556, 834

Step-4: Factors of 1679

List of positive integer factors of 1679 that divides 1668 without a remainder.

1, 23, 73

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1668 and 1679