What is the Greatest Common Factor of 60948 and 60962?

Greatest common factor (GCF) of 60948 and 60962 is 2.

GCF(60948,60962) = 2

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

How to find the GCF of 60948 and 60962?

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

Step-1: Prime Factorization of 60948

Prime factors of 60948 are 2, 3, 1693. Prime factorization of 60948 in exponential form is:

60948 = 2² × 3² × 1693¹

Step-2: Prime Factorization of 60962

Prime factors of 60962 are 2, 11, 17, 163. Prime factorization of 60962 in exponential form is:

60962 = 2¹ × 11¹ × 17¹ × 163¹

Step-3: Factors of 60948

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

1, 2, 3, 4, 6, 9, 12, 18, 36, 1693, 3386, 5079, 6772, 10158, 15237, 20316, 30474

Step-4: Factors of 60962

List of positive integer factors of 60962 that divides 60948 without a remainder.

1, 2, 11, 17, 22, 34, 163, 187, 326, 374, 1793, 2771, 3586, 5542, 30481

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 60948 and 60962