What is the Greatest Common Factor of 14952 and 14968?

Greatest common factor (GCF) of 14952 and 14968 is 8.

GCF(14952,14968) = 8

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

How to find the GCF of 14952 and 14968?

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

Step-1: Prime Factorization of 14952

Prime factors of 14952 are 2, 3, 7, 89. Prime factorization of 14952 in exponential form is:

14952 = 2³ × 3¹ × 7¹ × 89¹

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 14952

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

1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 89, 168, 178, 267, 356, 534, 623, 712, 1068, 1246, 1869, 2136, 2492, 3738, 4984, 7476

Step-4: Factors of 14968

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

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

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14952 and 14968