What is the Greatest Common Factor of 14968 and 14986?

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

GCF(14968,14986) = 2

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

How to find the GCF of 14968 and 14986?

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

Step-1: Prime Factorization of 14968

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

14968 = 2³ × 1871¹

Step-2: Prime Factorization of 14986

Prime factors of 14986 are 2, 59, 127. Prime factorization of 14986 in exponential form is:

14986 = 2¹ × 59¹ × 127¹

Step-3: Factors of 14968

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

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

Step-4: Factors of 14986

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

1, 2, 59, 118, 127, 254, 7493

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14968 and 14986