What is the Greatest Common Factor of 64540 and 64558?

Greatest common factor (GCF) of 64540 and 64558 is 2.

GCF(64540,64558) = 2

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

How to find the GCF of 64540 and 64558?

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

Step-1: Prime Factorization of 64540

Prime factors of 64540 are 2, 5, 7, 461. Prime factorization of 64540 in exponential form is:

64540 = 2² × 5¹ × 7¹ × 461¹

Step-2: Prime Factorization of 64558

Prime factors of 64558 are 2, 13, 191. Prime factorization of 64558 in exponential form is:

64558 = 2¹ × 13² × 191¹

Step-3: Factors of 64540

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

1, 2, 4, 5, 7, 10, 14, 20, 28, 35, 70, 140, 461, 922, 1844, 2305, 3227, 4610, 6454, 9220, 12908, 16135, 32270

Step-4: Factors of 64558

List of positive integer factors of 64558 that divides 64540 without a remainder.

1, 2, 13, 26, 169, 191, 338, 382, 2483, 4966, 32279

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 64540 and 64558