What is the Greatest Common Factor of 15961 and 15969?

Greatest common factor (GCF) of 15961 and 15969 is 1.

GCF(15961,15969) = 1

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

How to find the GCF of 15961 and 15969?

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

Step-1: Prime Factorization of 15961

Prime factors of 15961 are 11, 1451. Prime factorization of 15961 in exponential form is:

15961 = 11¹ × 1451¹

Step-2: Prime Factorization of 15969

Prime factors of 15969 are 3, 5323. Prime factorization of 15969 in exponential form is:

15969 = 3¹ × 5323¹

Step-3: Factors of 15961

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

1, 11, 1451

Step-4: Factors of 15969

List of positive integer factors of 15969 that divides 15961 without a remainder.

1, 3, 5323

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15961 and 15969