The number 16059
16059 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 101. Divisors (8): 1, 3, 53, 101, 159, 303, 5353, 16059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16059 is composite. Its prime factorisation is
- 3
The divisors add up to 22032; without 16059 itself that is 5973, so 16059 is deficient (5973 is less than 16059). Euler's totient φ(16059) = 10400 numbers up to 16059 share no factor with it.
- 4
The digits of 16059 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16059 = 3 \times 53 \times 101 \]
16059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22032 |
| Euler totient φ(n) | 10400 |
| Square | 257891481 |
| Cube | 4141479293379 |
| Square root | 126.724110 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.6059 × |
16059 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand and fifty-nine |
| Binary (base 2) | 11111010111011 |
| Octal (base 8) | 37273 |
| Hexadecimal (base 16) | 3EBB |
| Base 3 | 211000210 |
| As time | 16059 seconds = 4 h 27 min 39 s |
Is 16059 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 (16059 ÷ 3 = 5353) | 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 3) | 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 10) | 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 16059 a prime number?
No. 16059 = 3 × 53 × 101, so it is divisible by 3.
What are the factors of 16059?
1, 3, 53, 101, 159, 303, 5353, 16059.
What is 16059 in binary?
11111010111011 (hexadecimal 3EBB, octal 37273).
What is the square root of 16059?
About 126.7241.
Is 16059 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 16059?
It is a composite number with 8 divisors.