What is the Greatest Common Factor of 15951 and 15964?

Greatest common factor (GCF) of 15951 and 15964 is 13.

GCF(15951,15964) = 13

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

How to find the GCF of 15951 and 15964?

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

Prime factors of 15964 are 2, 13, 307. Prime factorization of 15964 in exponential form is:

15964 = 2² × 13¹ × 307¹

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 15964

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

1, 2, 4, 13, 26, 52, 307, 614, 1228, 3991, 7982

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15951 and 15964