What is the Greatest Common Factor of 14558 and 14564?

Greatest common factor (GCF) of 14558 and 14564 is 2.

GCF(14558,14564) = 2

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

How to find the GCF of 14558 and 14564?

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

Step-1: Prime Factorization of 14558

Prime factors of 14558 are 2, 29, 251. Prime factorization of 14558 in exponential form is:

14558 = 2¹ × 29¹ × 251¹

Step-2: Prime Factorization of 14564

Prime factors of 14564 are 2, 11, 331. Prime factorization of 14564 in exponential form is:

14564 = 2² × 11¹ × 331¹

Step-3: Factors of 14558

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

1, 2, 29, 58, 251, 502, 7279

Step-4: Factors of 14564

List of positive integer factors of 14564 that divides 14558 without a remainder.

1, 2, 4, 11, 22, 44, 331, 662, 1324, 3641, 7282

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 14558 and 14564