What is the Greatest Common Factor of 15480 and 15491?

Greatest common factor (GCF) of 15480 and 15491 is 1.

GCF(15480,15491) = 1

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

How to find the GCF of 15480 and 15491?

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

Step-1: Prime Factorization of 15480

Prime factors of 15480 are 2, 3, 5, 43. Prime factorization of 15480 in exponential form is:

15480 = 2³ × 3² × 5¹ × 43¹

Step-2: Prime Factorization of 15491

Prime factors of 15491 are 7, 2213. Prime factorization of 15491 in exponential form is:

15491 = 7¹ × 2213¹

Step-3: Factors of 15480

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

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 18, 20, 24, 30, 36, 40, 43, 45, 60, 72, 86, 90, 120, 129, 172, 180, 215, 258, 344, 360, 387, 430, 516, 645, 774, 860, 1032, 1290, 1548, 1720, 1935, 2580, 3096, 3870, 5160, 7740

Step-4: Factors of 15491

List of positive integer factors of 15491 that divides 15480 without a remainder.

1, 7, 2213

Final Step: Biggest Common Factor Number

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

Also check out the Least Common Multiple of 15480 and 15491