The number 16460
16460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 823. Divisors (12): 1, 2, 4, 5, 10, 20, 823, 1646, 3292, 4115, 8230, 16460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16460 is composite. Its prime factorisation is
- 3
The divisors add up to 34608; without 16460 itself that is 18148, so 16460 is abundant (18148 is more than 16460). Euler's totient φ(16460) = 6576 numbers up to 16460 share no factor with it.
- 4
The digits of 16460 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16460 = 2^{2} \times 5 \times 823 \]16460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 34608 |
| Euler totient φ(n) | 6576 |
| Square | 270931600 |
| Cube | 4459534136000 |
| Square root | 128.296532 (= 2√4115) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.646 × |
16460 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand four hundred and sixty |
| Binary (base 2) | 100000001001100 |
| Octal (base 8) | 40114 |
| Hexadecimal (base 16) | 404C |
| Base 3 | 211120122 |
| As time | 16460 seconds = 4 h 34 min 20 s |
Is 16460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16460 ÷ 2 = 8230) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16460 ÷ 4 = 4115) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (16460 ÷ 5 = 3292) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16460 ÷ 10 = 1646) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16460 a prime number?
No. 16460 = × 5 × 823, so it is divisible by 2.
What are the factors of 16460?
1, 2, 4, 5, 10, 20, 823, 1646, 3292, 4115, 8230, 16460.
What is 16460 in binary?
100000001001100 (hexadecimal 404C, octal 40114).
What is the square root of 16460?
About 128.2965, exactly 2√4115.
Is 16460 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 16460?
It is a composite number with 12 divisors.