What is the Greatest Common Factor of 15951 and 15956?

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

GCF(15951,15956) = 1

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

How to find the GCF of 15951 and 15956?

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

Step-1: 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-2: Prime Factorization of 15956

Prime factors of 15956 are 2, 3989. Prime factorization of 15956 in exponential form is:

15956 = 2² × 3989¹

Step-3: Factors of 15951

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

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

Step-4: Factors of 15956

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

1, 2, 4, 3989, 7978

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15951 and 15956