What is the Greatest Common Factor of 1552 and 1558?

Greatest common factor (GCF) of 1552 and 1558 is 2.

GCF(1552,1558) = 2

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

How to find the GCF of 1552 and 1558?

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

Step-1: Prime Factorization of 1552

Prime factors of 1552 are 2, 97. Prime factorization of 1552 in exponential form is:

1552 = 2⁴ × 97¹

Step-2: 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-3: Factors of 1552

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

1, 2, 4, 8, 16, 97, 194, 388, 776

Step-4: Factors of 1558

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1552 and 1558