What is the Greatest Common Factor of 15939 and 15947?

Greatest common factor (GCF) of 15939 and 15947 is 1.

GCF(15939,15947) = 1

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

How to find the GCF of 15939 and 15947?

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

Step-1: Prime Factorization of 15939

Prime factors of 15939 are 3, 7, 11, 23. Prime factorization of 15939 in exponential form is:

15939 = 3² × 7¹ × 11¹ × 23¹

Step-2: Prime Factorization of 15947

Prime factors of 15947 are 37, 431. Prime factorization of 15947 in exponential form is:

15947 = 37¹ × 431¹

Step-3: Factors of 15939

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

1, 3, 7, 9, 11, 21, 23, 33, 63, 69, 77, 99, 161, 207, 231, 253, 483, 693, 759, 1449, 1771, 2277, 5313

Step-4: Factors of 15947

List of positive integer factors of 15947 that divides 15939 without a remainder.

1, 37, 431

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15939 and 15947