What is the Greatest Common Factor of 14040 and 14051?

Greatest common factor (GCF) of 14040 and 14051 is 1.

GCF(14040,14051) = 1

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

How to find the GCF of 14040 and 14051?

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

Step-1: Prime Factorization of 14040

Prime factors of 14040 are 2, 3, 5, 13. Prime factorization of 14040 in exponential form is:

14040 = 2³ × 3³ × 5¹ × 13¹

Step-2: Prime Factorization of 14051

Prime factors of 14051 are 14051. Prime factorization of 14051 in exponential form is:

14051 = 14051¹

Step-3: Factors of 14040

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

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 13, 15, 18, 20, 24, 26, 27, 30, 36, 39, 40, 45, 52, 54, 60, 65, 72, 78, 90, 104, 108, 117, 120, 130, 135, 156, 180, 195, 216, 234, 260, 270, 312, 351, 360, 390, 468, 520, 540, 585, 702, 780, 936, 1080, 1170, 1404, 1560, 1755, 2340, 2808, 3510, 4680, 7020

Step-4: Factors of 14051

List of positive integer factors of 14051 that divides 14040 without a remainder.

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 14040 and 14051. The biggest common factor number is the GCF number.
So the greatest common factor 14040 and 14051 is 1.

Also check out the Least Common Multiple of 14040 and 14051