What is the Greatest Common Factor of 60958 and 60964?

Greatest common factor (GCF) of 60958 and 60964 is 2.

GCF(60958,60964) = 2

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

How to find the GCF of 60958 and 60964?

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

Step-1: Prime Factorization of 60958

Prime factors of 60958 are 2, 29, 1051. Prime factorization of 60958 in exponential form is:

60958 = 2¹ × 29¹ × 1051¹

Step-2: Prime Factorization of 60964

Prime factors of 60964 are 2, 15241. Prime factorization of 60964 in exponential form is:

60964 = 2² × 15241¹

Step-3: Factors of 60958

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

1, 2, 29, 58, 1051, 2102, 30479

Step-4: Factors of 60964

List of positive integer factors of 60964 that divides 60958 without a remainder.

1, 2, 4, 15241, 30482

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 60958 and 60964