What is the Greatest Common Factor of 15952 and 15957?

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

GCF(15952,15957) = 1

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

How to find the GCF of 15952 and 15957?

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

Step-1: Prime Factorization of 15952

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

15952 = 2⁴ × 997¹

Step-2: Prime Factorization of 15957

Prime factors of 15957 are 3, 197. Prime factorization of 15957 in exponential form is:

15957 = 3⁴ × 197¹

Step-3: Factors of 15952

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

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

Step-4: Factors of 15957

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

1, 3, 9, 27, 81, 197, 591, 1773, 5319

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15952 and 15957