The number 13959
13959 is a composite number with 16 divisors. Its prime factorisation is × 11 × 47. Divisors (16): 1, 3, 9, 11, 27, 33, 47, 99, 141, 297, 423, 517, 1269, 1551, 4653, 13959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13959: a Harshad number: divisible by its digit sum 27.
- 2
13959 is composite. Its prime factorisation is
- 3
The divisors add up to 23040; without 13959 itself that is 9081, so 13959 is deficient (9081 is less than 13959). Euler's totient φ(13959) = 8280 numbers up to 13959 share no factor with it.
- 4
The digits of 13959 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13959 = 3^{3} \times 11 \times 47 \]13959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 23040 |
| Euler totient φ(n) | 8280 |
| Square | 194853681 |
| Cube | 2719962533079 |
| Square root | 118.148212 (= 3√1551) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.3959 × |
13959 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand nine hundred and fifty-nine |
| Binary (base 2) | 11011010000111 |
| Octal (base 8) | 33207 |
| Hexadecimal (base 16) | 3687 |
| Base 3 | 201011000 |
| As time | 13959 seconds = 3 h 52 min 39 s |
Is 13959 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 (13959 ÷ 3 = 4653) | 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 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (13959 ÷ 9 = 1551) | 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 | Yes (13959 ÷ 11 = 1269) | 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 13959 a prime number?
No. 13959 = × 11 × 47, so it is divisible by 3.
What are the factors of 13959?
1, 3, 9, 11, 27, 33, 47, 99, 141, 297, 423, 517, 1269, 1551, 4653, 13959.
What is 13959 in binary?
11011010000111 (hexadecimal 3687, octal 33207).
What is the square root of 13959?
About 118.1482, exactly 3√1551.
Is 13959 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 13959?
13959 is a Harshad number: divisible by its digit sum 27.