What is the Greatest Common Factor of 13605 and 13609?

Greatest common factor (GCF) of 13605 and 13609 is 1.

GCF(13605,13609) = 1

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

How to find the GCF of 13605 and 13609?

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

Step-1: Prime Factorization of 13605

Prime factors of 13605 are 3, 5, 907. Prime factorization of 13605 in exponential form is:

13605 = 3¹ × 5¹ × 907¹

Step-2: Prime Factorization of 13609

Prime factors of 13609 are 31, 439. Prime factorization of 13609 in exponential form is:

13609 = 31¹ × 439¹

Step-3: Factors of 13605

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

1, 3, 5, 15, 907, 2721, 4535

Step-4: Factors of 13609

List of positive integer factors of 13609 that divides 13605 without a remainder.

1, 31, 439

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13605 and 13609