Divisors of 15360: All 44 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 15360

The number 15360 has 44 divisors:

1,  2,  3,  4,  5,  6,  8,  10,  12,  15,  16,  20,  24,  30,  32,  40,  48,  60,  64,  80,  96,  120,  128,  160,  192,  240,  256,  320,  384,  480,  512,  640,  768,  960,  1024,  1280,  1536,  1920,  2560,  3072,  3840,  5120,  7680,  15360

Divisor Pairs of 15360

Each pair multiplies to 15360:

Number of Divisors

The number 15360 has 44 divisors, written as τ(15360) = 44 in number theory.

Sum of Divisors

σ(15360) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 20 + 24 + 30 + 32 + 40 + 48 + 60 + 64 + 80 + 96 + 120 + 128 + 160 + 192 + 240 + 256 + 320 + 384 + 480 + 512 + 640 + 768 + 960 + 1024 + 1280 + 1536 + 1920 + 2560 + 3072 + 3840 + 5120 + 7680 + 15360 = 49128

Prime Factorization of 15360

See the full prime factorization calculator →

Properties of 15360

• 15360 is composite.
• 15360 is not a perfect square.
• Number of divisors: 44.
• Sum of divisors: 49128.

Common Divisors with Another Number?

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

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

1. 1 divides 15360 (15360 ÷ 1 = 15360) → pair (1, 15360)
2. 2 divides 15360 (15360 ÷ 2 = 7680) → pair (2, 7680)
3. 3 divides 15360 (15360 ÷ 3 = 5120) → pair (3, 5120)
4. 4 divides 15360 (15360 ÷ 4 = 3840) → pair (4, 3840)
5. 5 divides 15360 (15360 ÷ 5 = 3072) → pair (5, 3072)
6. 6 divides 15360 (15360 ÷ 6 = 2560) → pair (6, 2560)
7. 8 divides 15360 (15360 ÷ 8 = 1920) → pair (8, 1920)
8. 10 divides 15360 (15360 ÷ 10 = 1536) → pair (10, 1536)
9. 12 divides 15360 (15360 ÷ 12 = 1280) → pair (12, 1280)
10. 15 divides 15360 (15360 ÷ 15 = 1024) → pair (15, 1024)
11. 16 divides 15360 (15360 ÷ 16 = 960) → pair (16, 960)
12. 20 divides 15360 (15360 ÷ 20 = 768) → pair (20, 768)
13. 24 divides 15360 (15360 ÷ 24 = 640) → pair (24, 640)
14. 30 divides 15360 (15360 ÷ 30 = 512) → pair (30, 512)
15. 32 divides 15360 (15360 ÷ 32 = 480) → pair (32, 480)
16. 40 divides 15360 (15360 ÷ 40 = 384) → pair (40, 384)
17. 48 divides 15360 (15360 ÷ 48 = 320) → pair (48, 320)
18. 60 divides 15360 (15360 ÷ 60 = 256) → pair (60, 256)
19. 64 divides 15360 (15360 ÷ 64 = 240) → pair (64, 240)
20. 80 divides 15360 (15360 ÷ 80 = 192) → pair (80, 192)
21. 96 divides 15360 (15360 ÷ 96 = 160) → pair (96, 160)
22. 120 divides 15360 (15360 ÷ 120 = 128) → pair (120, 128)
23. Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 32, 40, 48, 60, 64, 80, 96, 120, 128, 160, 192, 240, 256, 320, 384, 480, 512, 640, 768, 960, 1024, 1280, 1536, 1920, 2560, 3072, 3840, 5120, 7680, 15360} — total 44 divisors.
24. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 10 + 12 + 15 + 16 + 20 + 24 + 30 + 32 + 40 + 48 + 60 + 64 + 80 + 96 + 120 + 128 + 160 + 192 + 240 + 256 + 320 + 384 + 480 + 512 + 640 + 768 + 960 + 1024 + 1280 + 1536 + 1920 + 2560 + 3072 + 3840 + 5120 + 7680 + 15360 = 49128.

Nearby Examples

Related Operations for 15360

• Multiples of a Number — "outward" complement of divisors
• 15360 Prime Factorization — decompose into prime building blocks
• Find GCF of 15360 and another number
• Find LCM of 15360 and another number
• Is 15360 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: