What is the Greatest Common Factor of 1558 and 1565?

Greatest common factor (GCF) of 1558 and 1565 is 1.

GCF(1558,1565) = 1

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

How to find the GCF of 1558 and 1565?

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

Step-1: Prime Factorization of 1558

Prime factors of 1558 are 2, 19, 41. Prime factorization of 1558 in exponential form is:

1558 = 2¹ × 19¹ × 41¹

Step-2: Prime Factorization of 1565

Prime factors of 1565 are 5, 313. Prime factorization of 1565 in exponential form is:

1565 = 5¹ × 313¹

Step-3: Factors of 1558

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

1, 2, 19, 38, 41, 82, 779

Step-4: Factors of 1565

List of positive integer factors of 1565 that divides 1558 without a remainder.

1, 5, 313

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1558 and 1565