Divisors of 5913: All 10 Factors
Quick Answer
5913 has 10 divisors (factors): 1, 3, 9, 27, 73, 81, 219, 657, 1971, 5913.
Sum: 8954.
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 5913
The number 5913 has 10 divisors:
1, 3, 9, 27, 73, 81, 219, 657, 1971, 5913
Divisor Pairs of 5913
Each pair multiplies to 5913:
| Factor 1 | × | Factor 2 | = | Product |
|---|---|---|---|---|
| 1 | × | 5913 | = | 5913 |
| 3 | × | 1971 | = | 5913 |
| 9 | × | 657 | = | 5913 |
| 27 | × | 219 | = | 5913 |
| 73 | × | 81 | = | 5913 |
Number of Divisors
The number 5913 has 10 divisors, written as τ(5913) = 10 in number theory.
Sum of Divisors
σ(5913) = 1 + 3 + 9 + 27 + 73 + 81 + 219 + 657 + 1971 + 5913 = 8954
Prime Factorization of 5913
Properties of 5913
- 5913 is composite.
- 5913 is not a perfect square.
- Number of divisors: 10.
- Sum of divisors: 8954.
Common Divisors with Another Number?
Looking for the divisors that 5913 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 5913
An efficient way to find divisors uses the complementary pair trick: check each integer i from 1 to √5913 ≈ 76.90. If i divides 5913, then both i and 5913/i are divisors.
- 1 divides 5913 (5913 ÷ 1 = 5913) → pair (1, 5913)
- 3 divides 5913 (5913 ÷ 3 = 1971) → pair (3, 1971)
- 9 divides 5913 (5913 ÷ 9 = 657) → pair (9, 657)
- 27 divides 5913 (5913 ÷ 27 = 219) → pair (27, 219)
- 73 divides 5913 (5913 ÷ 73 = 81) → pair (73, 81)
- Collect all unique values: {1, 3, 9, 27, 73, 81, 219, 657, 1971, 5913} — total 10 divisors.
- Sum: 1 + 3 + 9 + 27 + 73 + 81 + 219 + 657 + 1971 + 5913 = 8954.
Nearby Examples
Related Operations for 5913
- Multiples of 5913 — "outward" complement; M is a multiple of 5913 ⇔ 5913 is a divisor of M
- 5913 Prime Factorization — decompose into prime building blocks
- Find GCF of 5913 and another number
- Find LCM of 5913 and another number
- Is 5913 a perfect square? (odd divisor count ⇔ yes)
See also our tables of divisors:
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
- Multiples of a Number — "outward" complement
- Prime Factorization — product of prime divisors
- Greatest Common Factor (GCF) — largest common divisor of 2+ numbers
- Least Common Multiple (LCM) — smallest common multiple
- Is N a Perfect Square? — odd divisor count check