What is the Greatest Common Factor of 15938 and 15950?

Greatest common factor (GCF) of 15938 and 15950 is 2.

GCF(15938,15950) = 2

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

How to find the GCF of 15938 and 15950?

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

Step-1: Prime Factorization of 15938

Prime factors of 15938 are 2, 13, 613. Prime factorization of 15938 in exponential form is:

15938 = 2¹ × 13¹ × 613¹

Step-2: Prime Factorization of 15950

Prime factors of 15950 are 2, 5, 11, 29. Prime factorization of 15950 in exponential form is:

15950 = 2¹ × 5² × 11¹ × 29¹

Step-3: Factors of 15938

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

1, 2, 13, 26, 613, 1226, 7969

Step-4: Factors of 15950

List of positive integer factors of 15950 that divides 15938 without a remainder.

1, 2, 5, 10, 11, 22, 25, 29, 50, 55, 58, 110, 145, 275, 290, 319, 550, 638, 725, 1450, 1595, 3190, 7975

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15938 and 15950