Divisors of 14310: All 32 Factors

Quick Answer

14310 has 32 divisors (factors): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 53, 54, 90, 106, 135, 159, 265, 270, 318, 477, 530, 795, 954, 1431, 1590, 2385, 2862, 4770, 7155, 14310.

Sum: 38880.

Divisors (Factors) Calculator


  Ex.: 12, 36, 100, 1024, 1728, etc.
32 divisors
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 53, 54, 90, 106, 135, 159, 265, 270, 318, 477, 530, 795, 954, 1431, 1590, 2385, 2862, 4770, 7155, 14310

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 14310

The number 14310 has 32 divisors:

1,  2,  3,  5,  6,  9,  10,  15,  18,  27,  30,  45,  53,  54,  90,  106,  135,  159,  265,  270,  318,  477,  530,  795,  954,  1431,  1590,  2385,  2862,  4770,  7155,  14310

Divisor Pairs of 14310

Each pair multiplies to 14310:

Factor 1×Factor 2=Product
1×14310=14310
2×7155=14310
3×4770=14310
5×2862=14310
6×2385=14310
9×1590=14310
10×1431=14310
15×954=14310
18×795=14310
27×530=14310
30×477=14310
45×318=14310
53×270=14310
54×265=14310
90×159=14310
106×135=14310

Number of Divisors

The number 14310 has 32 divisors, written as τ(14310) = 32 in number theory.

Sum of Divisors

σ(14310) = 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 53 + 54 + 90 + 106 + 135 + 159 + 265 + 270 + 318 + 477 + 530 + 795 + 954 + 1431 + 1590 + 2385 + 2862 + 4770 + 7155 + 14310 = 38880

Properties of 14310

  • 14310 is composite.
  • 14310 is not a perfect square.
  • Number of divisors: 32.
  • Sum of divisors: 38880.

Common Divisors with Another Number?

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

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

  1. 1 divides 14310 (14310 ÷ 1 = 14310) → pair (1, 14310)
  2. 2 divides 14310 (14310 ÷ 2 = 7155) → pair (2, 7155)
  3. 3 divides 14310 (14310 ÷ 3 = 4770) → pair (3, 4770)
  4. 5 divides 14310 (14310 ÷ 5 = 2862) → pair (5, 2862)
  5. 6 divides 14310 (14310 ÷ 6 = 2385) → pair (6, 2385)
  6. 9 divides 14310 (14310 ÷ 9 = 1590) → pair (9, 1590)
  7. 10 divides 14310 (14310 ÷ 10 = 1431) → pair (10, 1431)
  8. 15 divides 14310 (14310 ÷ 15 = 954) → pair (15, 954)
  9. 18 divides 14310 (14310 ÷ 18 = 795) → pair (18, 795)
  10. 27 divides 14310 (14310 ÷ 27 = 530) → pair (27, 530)
  11. 30 divides 14310 (14310 ÷ 30 = 477) → pair (30, 477)
  12. 45 divides 14310 (14310 ÷ 45 = 318) → pair (45, 318)
  13. 53 divides 14310 (14310 ÷ 53 = 270) → pair (53, 270)
  14. 54 divides 14310 (14310 ÷ 54 = 265) → pair (54, 265)
  15. 90 divides 14310 (14310 ÷ 90 = 159) → pair (90, 159)
  16. 106 divides 14310 (14310 ÷ 106 = 135) → pair (106, 135)
  17. Collect all unique values: {1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 53, 54, 90, 106, 135, 159, 265, 270, 318, 477, 530, 795, 954, 1431, 1590, 2385, 2862, 4770, 7155, 14310} — total 32 divisors.
  18. Sum: 1 + 2 + 3 + 5 + 6 + 9 + 10 + 15 + 18 + 27 + 30 + 45 + 53 + 54 + 90 + 106 + 135 + 159 + 265 + 270 + 318 + 477 + 530 + 795 + 954 + 1431 + 1590 + 2385 + 2862 + 4770 + 7155 + 14310 = 38880.

Nearby Examples

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

Related Operations for 14310

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