What is the Greatest Common Factor of 15947 and 15952?

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

GCF(15947,15952) = 1

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

How to find the GCF of 15947 and 15952?

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

Step-1: Prime Factorization of 15947

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

15947 = 37¹ × 431¹

Step-2: Prime Factorization of 15952

Prime factors of 15952 are 2, 997. Prime factorization of 15952 in exponential form is:

15952 = 2⁴ × 997¹

Step-3: Factors of 15947

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

1, 37, 431

Step-4: Factors of 15952

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

1, 2, 4, 8, 16, 997, 1994, 3988, 7976

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15947 and 15952