The number 5913
5913 is a composite number with 10 divisors. Its prime factorisation is × 73. Divisors (10): 1, 3, 9, 27, 73, 81, 219, 657, 1971, 5913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5913 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5913 is composite. Its prime factorisation is
- 3
The divisors add up to 8954; without 5913 itself that is 3041, so 5913 is deficient (3041 is less than 5913). Euler's totient φ(5913) = 3888 numbers up to 5913 share no factor with it.
- 4
The digits of 5913 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 80 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5913 = 3^{4} \times 73 \]5913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 8954 |
| Euler totient φ(n) | 3888 |
| Square | 34963569 |
| Cube | 206739583497 |
| Square root | 76.896034 (= 9√73) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 80 |
| Scientific notation | 5.913 × |
5913 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and thirteen |
| Binary (base 2) | 1011100011001 |
| Octal (base 8) | 13431 |
| Hexadecimal (base 16) | 1719 |
| Base 3 | 22010000 |
| As time | 5913 seconds = 1 h 38 min 33 s |
Is 5913 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5913 ÷ 3 = 1971) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5913 ÷ 9 = 657) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5913 a prime number?
No. 5913 = × 73, so it is divisible by 3.
What are the factors of 5913?
1, 3, 9, 27, 73, 81, 219, 657, 1971, 5913.
What is 5913 in binary?
1011100011001 (hexadecimal 1719, octal 13431).
What is the square root of 5913?
About 76.8960, exactly 9√73.
Is 5913 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5913?
It is a composite number with 10 divisors.