What is the Greatest Common Factor of 64948 and 64962?

Greatest common factor (GCF) of 64948 and 64962 is 2.

GCF(64948,64962) = 2

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

How to find the GCF of 64948 and 64962?

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

Step-1: Prime Factorization of 64948

Prime factors of 64948 are 2, 13, 1249. Prime factorization of 64948 in exponential form is:

64948 = 2² × 13¹ × 1249¹

Step-2: Prime Factorization of 64962

Prime factors of 64962 are 2, 3, 401. Prime factorization of 64962 in exponential form is:

64962 = 2¹ × 3⁴ × 401¹

Step-3: Factors of 64948

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

1, 2, 4, 13, 26, 52, 1249, 2498, 4996, 16237, 32474

Step-4: Factors of 64962

List of positive integer factors of 64962 that divides 64948 without a remainder.

1, 2, 3, 6, 9, 18, 27, 54, 81, 162, 401, 802, 1203, 2406, 3609, 7218, 10827, 21654, 32481

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 64948 and 64962