The number 10590
10590 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 353. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 353, 706, 1059, 1765, 2118, 3530, 5295, 10590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10590: a Harshad number: divisible by its digit sum 15.
- 2
10590 is composite. Its prime factorisation is
- 3
The divisors add up to 25488; without 10590 itself that is 14898, so 10590 is abundant (14898 is more than 10590). Euler's totient φ(10590) = 2816 numbers up to 10590 share no factor with it.
- 4
The digits of 10590 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10590 = 2 \times 3 \times 5 \times 353 \]
10590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 25488 |
| Euler totient φ(n) | 2816 |
| Square | 112148100 |
| Cube | 1187648379000 |
| Square root | 102.907726 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.059 × |
10590 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and ninety |
| Binary (base 2) | 10100101011110 |
| Octal (base 8) | 24536 |
| Hexadecimal (base 16) | 295E |
| Base 3 | 112112020 |
| As time | 10590 seconds = 2 h 56 min 30 s |
Is 10590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10590 ÷ 2 = 5295) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10590 ÷ 3 = 3530) | 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 (10590 ÷ 5 = 2118) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10590 ÷ 6 = 1765) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10590 ÷ 10 = 1059) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10590 a prime number?
No. 10590 = 2 × 3 × 5 × 353, so it is divisible by 2.
What are the factors of 10590?
1, 2, 3, 5, 6, 10, 15, 30, 353, 706, 1059, 1765, 2118, 3530, 5295, 10590.
What is 10590 in binary?
10100101011110 (hexadecimal 295E, octal 24536).
What is the square root of 10590?
About 102.9077.
Is 10590 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10590?
10590 is a Harshad number: divisible by its digit sum 15.