What is the Greatest Common Factor of 15956 and 15962?

Greatest common factor (GCF) of 15956 and 15962 is 2.

GCF(15956,15962) = 2

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

How to find the GCF of 15956 and 15962?

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

Step-1: Prime Factorization of 15956

Prime factors of 15956 are 2, 3989. Prime factorization of 15956 in exponential form is:

15956 = 2² × 3989¹

Step-2: Prime Factorization of 15962

Prime factors of 15962 are 2, 23, 347. Prime factorization of 15962 in exponential form is:

15962 = 2¹ × 23¹ × 347¹

Step-3: Factors of 15956

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

1, 2, 4, 3989, 7978

Step-4: Factors of 15962

List of positive integer factors of 15962 that divides 15956 without a remainder.

1, 2, 23, 46, 347, 694, 7981

Final Step: Biggest Common Factor Number

We found the factors and prime factorization of 15956 and 15962. The biggest common factor number is the GCF number.
So the greatest common factor 15956 and 15962 is 2.

Also check out the Least Common Multiple of 15956 and 15962