What is the Greatest Common Factor of 15638 and 15642?

Greatest common factor (GCF) of 15638 and 15642 is 2.

GCF(15638,15642) = 2

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

How to find the GCF of 15638 and 15642?

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

Step-1: Prime Factorization of 15638

Prime factors of 15638 are 2, 7, 1117. Prime factorization of 15638 in exponential form is:

15638 = 2¹ × 7¹ × 1117¹

Step-2: Prime Factorization of 15642

Prime factors of 15642 are 2, 3, 11, 79. Prime factorization of 15642 in exponential form is:

15642 = 2¹ × 3² × 11¹ × 79¹

Step-3: Factors of 15638

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

1, 2, 7, 14, 1117, 2234, 7819

Step-4: Factors of 15642

List of positive integer factors of 15642 that divides 15638 without a remainder.

1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 79, 99, 158, 198, 237, 474, 711, 869, 1422, 1738, 2607, 5214, 7821

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15638 and 15642