What is the Greatest Common Factor of 13695 and 13702?

Greatest common factor (GCF) of 13695 and 13702 is 1.

GCF(13695,13702) = 1

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

How to find the GCF of 13695 and 13702?

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

Step-1: Prime Factorization of 13695

Prime factors of 13695 are 3, 5, 11, 83. Prime factorization of 13695 in exponential form is:

13695 = 3¹ × 5¹ × 11¹ × 83¹

Step-2: Prime Factorization of 13702

Prime factors of 13702 are 2, 13, 17, 31. Prime factorization of 13702 in exponential form is:

13702 = 2¹ × 13¹ × 17¹ × 31¹

Step-3: Factors of 13695

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

1, 3, 5, 11, 15, 33, 55, 83, 165, 249, 415, 913, 1245, 2739, 4565

Step-4: Factors of 13702

List of positive integer factors of 13702 that divides 13695 without a remainder.

1, 2, 13, 17, 26, 31, 34, 62, 221, 403, 442, 527, 806, 1054, 6851

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13695 and 13702