What is the Greatest Common Factor of 60940 and 60947?

Greatest common factor (GCF) of 60940 and 60947 is 1.

GCF(60940,60947) = 1

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

How to find the GCF of 60940 and 60947?

We will first find the prime factorization of 60940 and 60947. After we will calculate the factors of 60940 and 60947 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 60947

Prime factors of 60947 are 59, 1033. Prime factorization of 60947 in exponential form is:

60947 = 59¹ × 1033¹

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 60947

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

1, 59, 1033

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 60940 and 60947