What is the Greatest Common Factor of 13487 and 13498?

Greatest common factor (GCF) of 13487 and 13498 is 1.

GCF(13487,13498) = 1

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

How to find the GCF of 13487 and 13498?

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

Step-1: Prime Factorization of 13487

Prime factors of 13487 are 13487. Prime factorization of 13487 in exponential form is:

13487 = 13487¹

Step-2: Prime Factorization of 13498

Prime factors of 13498 are 2, 17, 397. Prime factorization of 13498 in exponential form is:

13498 = 2¹ × 17¹ × 397¹

Step-3: Factors of 13487

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

Step-4: Factors of 13498

List of positive integer factors of 13498 that divides 13487 without a remainder.

1, 2, 17, 34, 397, 794, 6749

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 13487 and 13498