What is the Greatest Common Factor of 14058 and 14062?

Greatest common factor (GCF) of 14058 and 14062 is 2.

GCF(14058,14062) = 2

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

How to find the GCF of 14058 and 14062?

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

Step-1: Prime Factorization of 14058

Prime factors of 14058 are 2, 3, 11, 71. Prime factorization of 14058 in exponential form is:

14058 = 2¹ × 3² × 11¹ × 71¹

Step-2: Prime Factorization of 14062

Prime factors of 14062 are 2, 79, 89. Prime factorization of 14062 in exponential form is:

14062 = 2¹ × 79¹ × 89¹

Step-3: Factors of 14058

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

1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 71, 99, 142, 198, 213, 426, 639, 781, 1278, 1562, 2343, 4686, 7029

Step-4: Factors of 14062

List of positive integer factors of 14062 that divides 14058 without a remainder.

1, 2, 79, 89, 158, 178, 7031

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14058 and 14062