The number 10592
10592 is a composite number with 12 divisors. Its prime factorisation is × 331. Divisors (12): 1, 2, 4, 8, 16, 32, 331, 662, 1324, 2648, 5296, 10592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10592 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10592 is composite. Its prime factorisation is
- 3
The divisors add up to 20916; without 10592 itself that is 10324, so 10592 is deficient (10324 is less than 10592). Euler's totient φ(10592) = 5280 numbers up to 10592 share no factor with it.
- 4
The digits of 10592 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10592 = 2^{5} \times 331 \]10592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 20916 |
| Euler totient φ(n) | 5280 |
| Square | 112190464 |
| Cube | 1188321394688 |
| Square root | 102.917443 (= 4√662) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.0592 × |
10592 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and ninety-two |
| Binary (base 2) | 10100101100000 |
| Octal (base 8) | 24540 |
| Hexadecimal (base 16) | 2960 |
| Base 3 | 112112022 |
| As time | 10592 seconds = 2 h 56 min 32 s |
Is 10592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10592 ÷ 2 = 5296) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (10592 ÷ 4 = 2648) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (10592 ÷ 8 = 1324) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10592 a prime number?
No. 10592 = × 331, so it is divisible by 2.
What are the factors of 10592?
1, 2, 4, 8, 16, 32, 331, 662, 1324, 2648, 5296, 10592.
What is 10592 in binary?
10100101100000 (hexadecimal 2960, octal 24540).
What is the square root of 10592?
About 102.9174, exactly 4√662.
Is 10592 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 10592?
It is a composite number with 12 divisors.