The number 10959
10959 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 281. Divisors (8): 1, 3, 13, 39, 281, 843, 3653, 10959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10959: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
10959 is composite. Its prime factorisation is
- 3
The divisors add up to 15792; without 10959 itself that is 4833, so 10959 is deficient (4833 is less than 10959). Euler's totient φ(10959) = 6720 numbers up to 10959 share no factor with it.
- 4
The digits of 10959 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 192 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10959 = 3 \times 13 \times 281 \]
10959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15792 |
| Euler totient φ(n) | 6720 |
| Square | 120099681 |
| Cube | 1316172404079 |
| Square root | 104.685243 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 192 |
| Scientific notation | 1.0959 × |
10959 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and fifty-nine |
| Binary (base 2) | 10101011001111 |
| Octal (base 8) | 25317 |
| Hexadecimal (base 16) | 2ACF |
| Base 3 | 120000220 |
| As time | 10959 seconds = 3 h 2 min 39 s |
Is 10959 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 (10959 ÷ 3 = 3653) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 4) | 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 7) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10959 a prime number?
No. 10959 = 3 × 13 × 281, so it is divisible by 3.
What are the factors of 10959?
1, 3, 13, 39, 281, 843, 3653, 10959.
What is 10959 in binary?
10101011001111 (hexadecimal 2ACF, octal 25317).
What is the square root of 10959?
About 104.6852.
Is 10959 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 10959?
10959 is a happy number: repeatedly adding the squares of its digits reaches 1.