What is the Greatest Common Factor of 14950 and 14968?

Greatest common factor (GCF) of 14950 and 14968 is 2.

GCF(14950,14968) = 2

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

How to find the GCF of 14950 and 14968?

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

Step-1: Prime Factorization of 14950

Prime factors of 14950 are 2, 5, 13, 23. Prime factorization of 14950 in exponential form is:

14950 = 2¹ × 5² × 13¹ × 23¹

Step-2: Prime Factorization of 14968

Prime factors of 14968 are 2, 1871. Prime factorization of 14968 in exponential form is:

14968 = 2³ × 1871¹

Step-3: Factors of 14950

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

1, 2, 5, 10, 13, 23, 25, 26, 46, 50, 65, 115, 130, 230, 299, 325, 575, 598, 650, 1150, 1495, 2990, 7475

Step-4: Factors of 14968

List of positive integer factors of 14968 that divides 14950 without a remainder.

1, 2, 4, 8, 1871, 3742, 7484

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14950 and 14968