Divisors of 32490: All 36 Factors

Divisors (Factors) Calculator

Use the calculator above to find all divisors (also called factors) of any positive integer up to 4,782,969. Beyond the divisor list, this tool also shows divisor pairs, the sum and count of divisors, prime factorization, and number properties (prime, perfect square, perfect number).

All Divisors of 32490

The number 32490 has 36 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  19,  30,  38,  45,  57,  90,  95,  114,  171,  190,  285,  342,  361,  570,  722,  855,  1083,  1710,  1805,  2166,  3249,  3610,  5415,  6498,  10830,  16245,  32490

Divisor Pairs of 32490

Each pair multiplies to 32490:

Number of Divisors

The number 32490 has 36 divisors, written as τ(32490) = 36 in number theory.

Sum of Divisors

σ(32490) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 19 + 30 + 38 + 45 + 57 + 90 + 95 + 114 + 171 + 190 + 285 + 342 + 361 + 570 + 722 + 855 + 1083 + 1710 + 1805 + 2166 + 3249 + 3610 + 5415 + 6498 + 10830 + 16245 + 32490 = 89154

Prime Factorization of 32490

See the full prime factorization calculator →

Properties of 32490

• 32490 is composite.
• 32490 is not a perfect square.
• Number of divisors: 36.
• Sum of divisors: 89154.

Common Divisors with Another Number?

Looking for the divisors that 32490 shares with another number? Use our Greatest Common Factor (GCF) calculator — it finds all common divisors and the largest one.

Step-by-Step: How to Find the Divisors of 32490

An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √32490 ≈ 180.25. If i divides 32490, then both i and 32490/i are divisors.

1. 1 divides 32490 (32490 ÷ 1 = 32490) → pair (1, 32490)
2. 2 divides 32490 (32490 ÷ 2 = 16245) → pair (2, 16245)
3. 3 divides 32490 (32490 ÷ 3 = 10830) → pair (3, 10830)
4. 5 divides 32490 (32490 ÷ 5 = 6498) → pair (5, 6498)
5. 6 divides 32490 (32490 ÷ 6 = 5415) → pair (6, 5415)
6. 9 divides 32490 (32490 ÷ 9 = 3610) → pair (9, 3610)
7. 10 divides 32490 (32490 ÷ 10 = 3249) → pair (10, 3249)
8. 15 divides 32490 (32490 ÷ 15 = 2166) → pair (15, 2166)
9. 18 divides 32490 (32490 ÷ 18 = 1805) → pair (18, 1805)
10. 19 divides 32490 (32490 ÷ 19 = 1710) → pair (19, 1710)
11. 30 divides 32490 (32490 ÷ 30 = 1083) → pair (30, 1083)
12. 38 divides 32490 (32490 ÷ 38 = 855) → pair (38, 855)
13. 45 divides 32490 (32490 ÷ 45 = 722) → pair (45, 722)
14. 57 divides 32490 (32490 ÷ 57 = 570) → pair (57, 570)
15. 90 divides 32490 (32490 ÷ 90 = 361) → pair (90, 361)
16. 95 divides 32490 (32490 ÷ 95 = 342) → pair (95, 342)
17. 114 divides 32490 (32490 ÷ 114 = 285) → pair (114, 285)
18. 171 divides 32490 (32490 ÷ 171 = 190) → pair (171, 190)
19. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 30, 38, 45, 57, 90, 95, 114, 171, 190, 285, 342, 361, 570, 722, 855, 1083, 1710, 1805, 2166, 3249, 3610, 5415, 6498, 10830, 16245, 32490} — total 36 divisors.
20. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 19 + 30 + 38 + 45 + 57 + 90 + 95 + 114 + 171 + 190 + 285 + 342 + 361 + 570 + 722 + 855 + 1083 + 1710 + 1805 + 2166 + 3249 + 3610 + 5415 + 6498 + 10830 + 16245 + 32490 = 89154.

Nearby Examples

Related Operations for 32490

• Multiples of a Number — "outward" complement of divisors
• 32490 Prime Factorization — decompose into prime building blocks
• Find GCF of 32490 and another number
• Find LCM of 32490 and another number
• Is 32490 a perfect square? (odd divisor count ⇔ yes)

See also our tables of divisors:

• Table of all divisors from 1 to 100
• Table of all divisors from 1 to 500
• Table of all divisors from 1 to 1,000
• Table of all divisors from 1 to 10,000

What Is a Divisor?

A divisor (also called a factor) of a positive integer n is any positive integer d such that n ÷ d has no remainder. In other words, d divides n evenly.

Every positive integer n has at least two divisors: 1 and n itself (with 1 being the trivial case of having only itself). Numbers with exactly 2 divisors are prime; numbers with 3 or more divisors are composite.

Why use this calculator? Beyond just listing divisors, this tool computes the sum σ(n), the count τ(n), prime factorization, divisor pairs (useful for visual learners and factoring problems), and detects whether n is a prime, a perfect square, or a perfect number.

References

• [1] Divisor (Wikipedia)
• [2] Divisor function (Wikipedia)
• [3] Divisor (Wolfram MathWorld)

Divisors Calculation Examples

Find all divisors of these numbers: