The number 11590
11590 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 19 × 61. Divisors (16): 1, 2, 5, 10, 19, 38, 61, 95, 122, 190, 305, 610, 1159, 2318, 5795, 11590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11590 is composite. Its prime factorisation is
- 3
The divisors add up to 22320; without 11590 itself that is 10730, so 11590 is deficient (10730 is less than 11590). Euler's totient φ(11590) = 4320 numbers up to 11590 share no factor with it.
- 4
The digits of 11590 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11590 = 2 \times 5 \times 19 \times 61 \]
11590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 22320 |
| Euler totient φ(n) | 4320 |
| Square | 134328100 |
| Cube | 1556862679000 |
| Square root | 107.656862 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.159 × |
11590 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and ninety |
| Binary (base 2) | 10110101000110 |
| Octal (base 8) | 26506 |
| Hexadecimal (base 16) | 2D46 |
| Base 3 | 120220021 |
| As time | 11590 seconds = 3 h 13 min 10 s |
Is 11590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11590 ÷ 2 = 5795) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11590 ÷ 5 = 2318) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11590 ÷ 10 = 1159) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11590 a prime number?
No. 11590 = 2 × 5 × 19 × 61, so it is divisible by 2.
What are the factors of 11590?
1, 2, 5, 10, 19, 38, 61, 95, 122, 190, 305, 610, 1159, 2318, 5795, 11590.
What is 11590 in binary?
10110101000110 (hexadecimal 2D46, octal 26506).
What is the square root of 11590?
About 107.6569.
Is 11590 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 11590?
It is a composite number with 16 divisors.