What is the Greatest Common Factor of 15558 and 15568?

Greatest common factor (GCF) of 15558 and 15568 is 2.

GCF(15558,15568) = 2

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

How to find the GCF of 15558 and 15568?

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

Step-1: Prime Factorization of 15558

Prime factors of 15558 are 2, 3, 2593. Prime factorization of 15558 in exponential form is:

15558 = 2¹ × 3¹ × 2593¹

Step-2: Prime Factorization of 15568

Prime factors of 15568 are 2, 7, 139. Prime factorization of 15568 in exponential form is:

15568 = 2⁴ × 7¹ × 139¹

Step-3: Factors of 15558

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

1, 2, 3, 6, 2593, 5186, 7779

Step-4: Factors of 15568

List of positive integer factors of 15568 that divides 15558 without a remainder.

1, 2, 4, 7, 8, 14, 16, 28, 56, 112, 139, 278, 556, 973, 1112, 1946, 2224, 3892, 7784

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15558 and 15568