Divisors of 46080: All 66 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 46080

The number 46080 has 66 divisors:

1,  2,  3,  4,  5,  6,  8,  9,  10,  12,  15,  16,  18,  20,  24,  30,  32,  36,  40,  45,  48,  60,  64,  72,  80,  90,  96,  120,  128,  144,  160,  180,  192,  240,  256,  288,  320,  360,  384,  480,  512,  576,  640,  720,  768,  960,  1024,  1152,  1280,  1440,  1536,  1920,  2304,  2560,  2880,  3072,  3840,  4608,  5120,  5760,  7680,  9216,  11520,  15360,  23040,  46080

Divisor Pairs of 46080

Each pair multiplies to 46080:

Number of Divisors

The number 46080 has 66 divisors, written as τ(46080) = 66 in number theory.

Sum of Divisors

σ(46080) = 1 + 2 + 3 + 4 + 5 + 6 + 8 + 9 + 10 + 12 + 15 + 16 + 18 + 20 + 24 + 30 + 32 + 36 + 40 + 45 + 48 + 60 + 64 + 72 + 80 + 90 + 96 + 120 + 128 + 144 + 160 + 180 + 192 + 240 + 256 + 288 + 320 + 360 + 384 + 480 + 512 + 576 + 640 + 720 + 768 + 960 + 1024 + 1152 + 1280 + 1440 + 1536 + 1920 + 2304 + 2560 + 2880 + 3072 + 3840 + 4608 + 5120 + 5760 + 7680 + 9216 + 11520 + 15360 + 23040 + 46080 = 159666

Prime Factorization of 46080

See the full prime factorization calculator →

Properties of 46080

• 46080 is composite.
• 46080 is not a perfect square.
• Number of divisors: 66.
• Sum of divisors: 159666.

Common Divisors with Another Number?

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

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

1. 1 divides 46080 (46080 ÷ 1 = 46080) → pair (1, 46080)
2. 2 divides 46080 (46080 ÷ 2 = 23040) → pair (2, 23040)
3. 3 divides 46080 (46080 ÷ 3 = 15360) → pair (3, 15360)
4. 4 divides 46080 (46080 ÷ 4 = 11520) → pair (4, 11520)
5. 5 divides 46080 (46080 ÷ 5 = 9216) → pair (5, 9216)
6. 6 divides 46080 (46080 ÷ 6 = 7680) → pair (6, 7680)
7. 8 divides 46080 (46080 ÷ 8 = 5760) → pair (8, 5760)
8. 9 divides 46080 (46080 ÷ 9 = 5120) → pair (9, 5120)
9. 10 divides 46080 (46080 ÷ 10 = 4608) → pair (10, 4608)
10. 12 divides 46080 (46080 ÷ 12 = 3840) → pair (12, 3840)
11. 15 divides 46080 (46080 ÷ 15 = 3072) → pair (15, 3072)
12. 16 divides 46080 (46080 ÷ 16 = 2880) → pair (16, 2880)
13. 18 divides 46080 (46080 ÷ 18 = 2560) → pair (18, 2560)
14. 20 divides 46080 (46080 ÷ 20 = 2304) → pair (20, 2304)
15. 24 divides 46080 (46080 ÷ 24 = 1920) → pair (24, 1920)
16. 30 divides 46080 (46080 ÷ 30 = 1536) → pair (30, 1536)
17. 32 divides 46080 (46080 ÷ 32 = 1440) → pair (32, 1440)
18. 36 divides 46080 (46080 ÷ 36 = 1280) → pair (36, 1280)
19. 40 divides 46080 (46080 ÷ 40 = 1152) → pair (40, 1152)
20. 45 divides 46080 (46080 ÷ 45 = 1024) → pair (45, 1024)
21. 48 divides 46080 (46080 ÷ 48 = 960) → pair (48, 960)
22. 60 divides 46080 (46080 ÷ 60 = 768) → pair (60, 768)
23. 64 divides 46080 (46080 ÷ 64 = 720) → pair (64, 720)
24. 72 divides 46080 (46080 ÷ 72 = 640) → pair (72, 640)
25. 80 divides 46080 (46080 ÷ 80 = 576) → pair (80, 576)
26. 90 divides 46080 (46080 ÷ 90 = 512) → pair (90, 512)
27. 96 divides 46080 (46080 ÷ 96 = 480) → pair (96, 480)
28. 120 divides 46080 (46080 ÷ 120 = 384) → pair (120, 384)
29. 128 divides 46080 (46080 ÷ 128 = 360) → pair (128, 360)
30. 144 divides 46080 (46080 ÷ 144 = 320) → pair (144, 320)
31. 160 divides 46080 (46080 ÷ 160 = 288) → pair (160, 288)
32. 180 divides 46080 (46080 ÷ 180 = 256) → pair (180, 256)
33. 192 divides 46080 (46080 ÷ 192 = 240) → pair (192, 240)
34. Collect all unique values: {1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, 16, 18, 20, 24, 30, 32, 36, 40, 45, 48, 60, 64, 72, 80, 90, 96, 120, 128, 144, 160, 180, 192, 240, 256, 288, 320, 360, 384, 480, 512, 576, 640, 720, 768, 960, 1024, 1152, 1280, 1440, 1536, 1920, 2304, 2560, 2880, 3072, 3840, 4608, 5120, 5760, 7680, 9216, 11520, 15360, 23040, 46080} — total 66 divisors.
35. Sum: 1 + 2 + 3 + 4 + 5 + 6 + 8 + 9 + 10 + 12 + 15 + 16 + 18 + 20 + 24 + 30 + 32 + 36 + 40 + 45 + 48 + 60 + 64 + 72 + 80 + 90 + 96 + 120 + 128 + 144 + 160 + 180 + 192 + 240 + 256 + 288 + 320 + 360 + 384 + 480 + 512 + 576 + 640 + 720 + 768 + 960 + 1024 + 1152 + 1280 + 1440 + 1536 + 1920 + 2304 + 2560 + 2880 + 3072 + 3840 + 4608 + 5120 + 5760 + 7680 + 9216 + 11520 + 15360 + 23040 + 46080 = 159666.

Nearby Examples

Related Operations for 46080

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