What is the Greatest Common Factor of 60940 and 60951?

Greatest common factor (GCF) of 60940 and 60951 is 11.

GCF(60940,60951) = 11

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

How to find the GCF of 60940 and 60951?

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

Step-1: Prime Factorization of 60940

Prime factors of 60940 are 2, 5, 11, 277. Prime factorization of 60940 in exponential form is:

60940 = 2² × 5¹ × 11¹ × 277¹

Step-2: Prime Factorization of 60951

Prime factors of 60951 are 3, 11, 1847. Prime factorization of 60951 in exponential form is:

60951 = 3¹ × 11¹ × 1847¹

Step-3: Factors of 60940

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

1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 277, 554, 1108, 1385, 2770, 3047, 5540, 6094, 12188, 15235, 30470

Step-4: Factors of 60951

List of positive integer factors of 60951 that divides 60940 without a remainder.

1, 3, 11, 33, 1847, 5541, 20317

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 60940 and 60951. The biggest common factor number is the GCF number.
So the greatest common factor 60940 and 60951 is 11.

Also check out the Least Common Multiple of 60940 and 60951