What is the Greatest Common Factor of 15940 and 15951?

Greatest common factor (GCF) of 15940 and 15951 is 1.

GCF(15940,15951) = 1

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

How to find the GCF of 15940 and 15951?

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

Step-1: Prime Factorization of 15940

Prime factors of 15940 are 2, 5, 797. Prime factorization of 15940 in exponential form is:

15940 = 2² × 5¹ × 797¹

Step-2: Prime Factorization of 15951

Prime factors of 15951 are 3, 13, 409. Prime factorization of 15951 in exponential form is:

15951 = 3¹ × 13¹ × 409¹

Step-3: Factors of 15940

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

1, 2, 4, 5, 10, 20, 797, 1594, 3188, 3985, 7970

Step-4: Factors of 15951

List of positive integer factors of 15951 that divides 15940 without a remainder.

1, 3, 13, 39, 409, 1227, 5317

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15940 and 15951