The number 16497
16497 is a composite number with 16 divisors. Its prime factorisation is × 13 × 47. Divisors (16): 1, 3, 9, 13, 27, 39, 47, 117, 141, 351, 423, 611, 1269, 1833, 5499, 16497.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16497: a Harshad number: divisible by its digit sum 27.
- 2
16497 is composite. Its prime factorisation is
- 3
The divisors add up to 26880; without 16497 itself that is 10383, so 16497 is deficient (10383 is less than 16497). Euler's totient φ(16497) = 9936 numbers up to 16497 share no factor with it.
- 4
The digits of 16497 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 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16497 = 3^{3} \times 13 \times 47 \]16497 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 26880 |
| Euler totient φ(n) | 9936 |
| Square | 272151009 |
| Cube | 4489675195473 |
| Square root | 128.440648 (= 3√1833) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.6497 × |
16497 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand four hundred and ninety-seven |
| Binary (base 2) | 100000001110001 |
| Octal (base 8) | 40161 |
| Hexadecimal (base 16) | 4071 |
| Base 3 | 211122000 |
| As time | 16497 seconds = 4 h 34 min 57 s |
Is 16497 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 (16497 ÷ 3 = 5499) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (16497 ÷ 9 = 1833) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16497 a prime number?
No. 16497 = × 13 × 47, so it is divisible by 3.
What are the factors of 16497?
1, 3, 9, 13, 27, 39, 47, 117, 141, 351, 423, 611, 1269, 1833, 5499, 16497.
What is 16497 in binary?
100000001110001 (hexadecimal 4071, octal 40161).
What is the square root of 16497?
About 128.4406, exactly 3√1833.
Is 16497 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 16497?
16497 is a Harshad number: divisible by its digit sum 27.