What is the Greatest Common Factor of 1665 and 1678?

Greatest common factor (GCF) of 1665 and 1678 is 1.

GCF(1665,1678) = 1

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

How to find the GCF of 1665 and 1678?

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

Step-1: Prime Factorization of 1665

Prime factors of 1665 are 3, 5, 37. Prime factorization of 1665 in exponential form is:

1665 = 3² × 5¹ × 37¹

Step-2: Prime Factorization of 1678

Prime factors of 1678 are 2, 839. Prime factorization of 1678 in exponential form is:

1678 = 2¹ × 839¹

Step-3: Factors of 1665

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

1, 3, 5, 9, 15, 37, 45, 111, 185, 333, 555

Step-4: Factors of 1678

List of positive integer factors of 1678 that divides 1665 without a remainder.

1, 2, 839

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1665 and 1678