The number 16500
16500 is a composite number with 48 divisors. Its prime factorisation is × 3 × × 11. Divisors (48): 1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 20, 22, 25, 30, 33, 44 … 16500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16500: a Harshad number: divisible by its digit sum 12.
- 2
16500 is composite. Its prime factorisation is
- 3
The divisors add up to 52416; without 16500 itself that is 35916, so 16500 is abundant (35916 is more than 16500). Euler's totient φ(16500) = 4000 numbers up to 16500 share no factor with it.
- 4
The digits of 16500 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16500 = 2^{2} \times 3 \times 5^{3} \times 11 \]16500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 52416 |
| Euler totient φ(n) | 4000 |
| Square | 272250000 |
| Cube | 4492125000000 |
| Square root | 128.452326 (= 10√165) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.65 × |
16500 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred |
| Binary (base 2) | 100000001110100 |
| Octal (base 8) | 40164 |
| Hexadecimal (base 16) | 4074 |
| Base 3 | 211122010 |
| As time | 16500 seconds = 4 h 35 min 0 s |
Is 16500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16500 ÷ 2 = 8250) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16500 ÷ 3 = 5500) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16500 ÷ 4 = 4125) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (16500 ÷ 5 = 3300) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (16500 ÷ 6 = 2750) | 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 4) | 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 | Yes (16500 ÷ 10 = 1650) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (16500 ÷ 11 = 1500) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (16500 ÷ 12 = 1375) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16500 a prime number?
No. 16500 = × 3 × × 11, so it is divisible by 2.
What are the factors of 16500?
1, 2, 3, 4, 5, 6, 10, 11, 12, 15, 20, 22, 25, 30, 33, 44, 50, 55, 60, 66, 75, 100, 110, 125, 132, 150, 165, 220, 250, 275, 300, 330, 375, 500, 550, 660, 750, 825, 1100, 1375, 1500, 1650, 2750, 3300, 4125, 5500, 8250, 16500.
What is 16500 in binary?
100000001110100 (hexadecimal 4074, octal 40164).
What is the square root of 16500?
About 128.4523, exactly 10√165.
Is 16500 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 16500?
16500 is a Harshad number: divisible by its digit sum 12.