The number 16959
16959 is a composite number with 4 divisors. Its prime factorisation is 3 × 5653. Divisors (4): 1, 3, 5653, 16959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16959: a semiprime: 3 × 5653, the product of two primes.
- 2
16959 is composite. Its prime factorisation is
- 3
The divisors add up to 22616; without 16959 itself that is 5657, so 16959 is deficient (5657 is less than 16959). Euler's totient φ(16959) = 11304 numbers up to 16959 share no factor with it.
- 4
The digits of 16959 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16959 = 3 \times 5653 \]
16959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22616 |
| Euler totient φ(n) | 11304 |
| Square | 287607681 |
| Cube | 4877538662079 |
| Square root | 130.226725 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.6959 × |
16959 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and fifty-nine |
| Binary (base 2) | 100001000111111 |
| Octal (base 8) | 41077 |
| Hexadecimal (base 16) | 423F |
| Base 3 | 212021010 |
| As time | 16959 seconds = 4 h 42 min 39 s |
Is 16959 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 (16959 ÷ 3 = 5653) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 8) | 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 16959 a prime number?
No. 16959 = 3 × 5653, so it is divisible by 3.
What are the factors of 16959?
1, 3, 5653, 16959.
What is 16959 in binary?
100001000111111 (hexadecimal 423F, octal 41077).
What is the square root of 16959?
About 130.2267.
Is 16959 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 16959?
16959 is a semiprime: 3 × 5653, the product of two primes.