What is the Greatest Common Factor of 15950 and 15968?

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

GCF(15950,15968) = 2

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

How to find the GCF of 15950 and 15968?

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

Step-1: 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-2: Prime Factorization of 15968

Prime factors of 15968 are 2, 499. Prime factorization of 15968 in exponential form is:

15968 = 2⁵ × 499¹

Step-3: Factors of 15950

List of positive integer factors of 15950 that divides 15950 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

Step-4: Factors of 15968

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

1, 2, 4, 8, 16, 32, 499, 998, 1996, 3992, 7984

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15950 and 15968