What is the Greatest Common Factor of 13480 and 13497?

Greatest common factor (GCF) of 13480 and 13497 is 1.

GCF(13480,13497) = 1

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

How to find the GCF of 13480 and 13497?

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

Step-1: Prime Factorization of 13480

Prime factors of 13480 are 2, 5, 337. Prime factorization of 13480 in exponential form is:

13480 = 2³ × 5¹ × 337¹

Step-2: Prime Factorization of 13497

Prime factors of 13497 are 3, 11, 409. Prime factorization of 13497 in exponential form is:

13497 = 3¹ × 11¹ × 409¹

Step-3: Factors of 13480

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

1, 2, 4, 5, 8, 10, 20, 40, 337, 674, 1348, 1685, 2696, 3370, 6740

Step-4: Factors of 13497

List of positive integer factors of 13497 that divides 13480 without a remainder.

1, 3, 11, 33, 409, 1227, 4499

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13480 and 13497