What is the Greatest Common Factor of 15686 and 15705?

Greatest common factor (GCF) of 15686 and 15705 is 1.

GCF(15686,15705) = 1

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

How to find the GCF of 15686 and 15705?

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

Step-1: Prime Factorization of 15686

Prime factors of 15686 are 2, 11, 23, 31. Prime factorization of 15686 in exponential form is:

15686 = 2¹ × 11¹ × 23¹ × 31¹

Step-2: Prime Factorization of 15705

Prime factors of 15705 are 3, 5, 349. Prime factorization of 15705 in exponential form is:

15705 = 3² × 5¹ × 349¹

Step-3: Factors of 15686

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

1, 2, 11, 22, 23, 31, 46, 62, 253, 341, 506, 682, 713, 1426, 7843

Step-4: Factors of 15705

List of positive integer factors of 15705 that divides 15686 without a remainder.

1, 3, 5, 9, 15, 45, 349, 1047, 1745, 3141, 5235

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15686 and 15705