Divisors of 29490: All 16 Factors

Quick Answer

29490 has 16 divisors (factors): 1, 2, 3, 5, 6, 10, 15, 30, 983, 1966, 2949, 4915, 5898, 9830, 14745, 29490.

Sum: 70848.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
16 divisors
1, 2, 3, 5, 6, 10, 15, 30, 983, 1966, 2949, 4915, 5898, 9830, 14745, 29490

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 29490

The number 29490 has 16 divisors:

1,  2,  3,  5,  6,  10,  15,  30,  983,  1966,  2949,  4915,  5898,  9830,  14745,  29490

Divisor Pairs of 29490

Each pair multiplies to 29490:

Factor 1×Factor 2=Product
1×29490=29490
2×14745=29490
3×9830=29490
5×5898=29490
6×4915=29490
10×2949=29490
15×1966=29490
30×983=29490

Number of Divisors

The number 29490 has 16 divisors, written as τ(29490) = 16 in number theory.

Sum of Divisors

σ(29490) = 1 + 2 + 3 + 5 + 6 + 10 + 15 + 30 + 983 + 1966 + 2949 + 4915 + 5898 + 9830 + 14745 + 29490 = 70848

Properties of 29490

  • 29490 is composite.
  • 29490 is not a perfect square.
  • Number of divisors: 16.
  • Sum of divisors: 70848.

Common Divisors with Another Number?

Looking for the divisors that 29490 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 29490

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

  1. 1 divides 29490 (29490 ÷ 1 = 29490) → pair (1, 29490)
  2. 2 divides 29490 (29490 ÷ 2 = 14745) → pair (2, 14745)
  3. 3 divides 29490 (29490 ÷ 3 = 9830) → pair (3, 9830)
  4. 5 divides 29490 (29490 ÷ 5 = 5898) → pair (5, 5898)
  5. 6 divides 29490 (29490 ÷ 6 = 4915) → pair (6, 4915)
  6. 10 divides 29490 (29490 ÷ 10 = 2949) → pair (10, 2949)
  7. 15 divides 29490 (29490 ÷ 15 = 1966) → pair (15, 1966)
  8. 30 divides 29490 (29490 ÷ 30 = 983) → pair (30, 983)
  9. Collect all unique values: {1, 2, 3, 5, 6, 10, 15, 30, 983, 1966, 2949, 4915, 5898, 9830, 14745, 29490} — total 16 divisors.
  10. Sum: 1 + 2 + 3 + 5 + 6 + 10 + 15 + 30 + 983 + 1966 + 2949 + 4915 + 5898 + 9830 + 14745 + 29490 = 70848.

Nearby Examples

ndivisors countsum σ(n)
360241170
24020744
18018546
14415403
12016360
1009217
9012234
8412224

Related Operations for 29490

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.

Divisors Calculation Examples

Find all divisors of these numbers:

Related Calculators