The number 16536
16536 is a composite number with 32 divisors. Its prime factorisation is × 3 × 13 × 53. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 13, 24, 26, 39, 52, 53, 78, 104, 106 … 16536.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16536 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16536 is composite. Its prime factorisation is
- 3
The divisors add up to 45360; without 16536 itself that is 28824, so 16536 is abundant (28824 is more than 16536). Euler's totient φ(16536) = 4992 numbers up to 16536 share no factor with it.
- 4
The digits of 16536 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 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16536 = 2^{3} \times 3 \times 13 \times 53 \]16536 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 45360 |
| Euler totient φ(n) | 4992 |
| Square | 273439296 |
| Cube | 4521592198656 |
| Square root | 128.592379 (= 2√4134) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 159 |
| Scientific notation | 1.6536 × |
16536 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and thirty-six |
| Binary (base 2) | 100000010011000 |
| Octal (base 8) | 40230 |
| Hexadecimal (base 16) | 4098 |
| Base 3 | 211200110 |
| As time | 16536 seconds = 4 h 35 min 36 s |
Is 16536 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16536 ÷ 2 = 8268) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16536 ÷ 3 = 5512) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16536 ÷ 4 = 4134) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (16536 ÷ 6 = 2756) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (16536 ÷ 8 = 2067) | 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 6) | 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 | Yes (16536 ÷ 12 = 1378) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16536 a prime number?
No. 16536 = × 3 × 13 × 53, so it is divisible by 2.
What are the factors of 16536?
1, 2, 3, 4, 6, 8, 12, 13, 24, 26, 39, 52, 53, 78, 104, 106, 156, 159, 212, 312, 318, 424, 636, 689, 1272, 1378, 2067, 2756, 4134, 5512, 8268, 16536.
What is 16536 in binary?
100000010011000 (hexadecimal 4098, octal 40230).
What is the square root of 16536?
About 128.5924, exactly 2√4134.
Is 16536 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 16536?
It is a composite number with 32 divisors.