What is the Greatest Common Factor of 1360 and 1369?

Greatest common factor (GCF) of 1360 and 1369 is 1.

GCF(1360,1369) = 1

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

How to find the GCF of 1360 and 1369?

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

Step-1: Prime Factorization of 1360

Prime factors of 1360 are 2, 5, 17. Prime factorization of 1360 in exponential form is:

1360 = 2⁴ × 5¹ × 17¹

Step-2: Prime Factorization of 1369

Prime factors of 1369 are 37. Prime factorization of 1369 in exponential form is:

1369 = 37²

Step-3: Factors of 1360

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

1, 2, 4, 5, 8, 10, 16, 17, 20, 34, 40, 68, 80, 85, 136, 170, 272, 340, 680

Step-4: Factors of 1369

List of positive integer factors of 1369 that divides 1360 without a remainder.

1, 37

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 1360 and 1369