The number 16464
16464 is a composite number with 40 divisors. Its prime factorisation is × 3 × . Divisors (40): 1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 42, 48, 49 … 16464.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16464: a Harshad number: divisible by its digit sum 21.
- 2
16464 is composite. Its prime factorisation is
- 3
The divisors add up to 49600; without 16464 itself that is 33136, so 16464 is abundant (33136 is more than 16464). Euler's totient φ(16464) = 4704 numbers up to 16464 share no factor with it.
- 4
The digits of 16464 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 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16464 = 2^{4} \times 3 \times 7^{3} \]16464 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 49600 |
| Euler totient φ(n) | 4704 |
| Square | 271063296 |
| Cube | 4462786105344 |
| Square root | 128.312119 (= 28√21) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 128 |
| Scientific notation | 1.6464 × |
16464 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand four hundred and sixty-four |
| Binary (base 2) | 100000001010000 |
| Octal (base 8) | 40120 |
| Hexadecimal (base 16) | 4050 |
| Base 3 | 211120210 |
| As time | 16464 seconds = 4 h 34 min 24 s |
Is 16464 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16464 ÷ 2 = 8232) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16464 ÷ 3 = 5488) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16464 ÷ 4 = 4116) | 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 | Yes (16464 ÷ 6 = 2744) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (16464 ÷ 7 = 2352) | 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 (16464 ÷ 8 = 2058) | 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 4) | 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 | Yes (16464 ÷ 12 = 1372) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16464 a prime number?
No. 16464 = × 3 × , so it is divisible by 2.
What are the factors of 16464?
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 42, 48, 49, 56, 84, 98, 112, 147, 168, 196, 294, 336, 343, 392, 588, 686, 784, 1029, 1176, 1372, 2058, 2352, 2744, 4116, 5488, 8232, 16464.
What is 16464 in binary?
100000001010000 (hexadecimal 4050, octal 40120).
What is the square root of 16464?
About 128.3121, exactly 28√21.
Is 16464 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 16464?
16464 is a Harshad number: divisible by its digit sum 21.