The number 16492
16492 is a composite number with 24 divisors. Its prime factorisation is × 7 × 19 × 31. Divisors (24): 1, 2, 4, 7, 14, 19, 28, 31, 38, 62, 76, 124, 133, 217, 266, 434 … 16492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16492 is composite. Its prime factorisation is
- 3
The divisors add up to 35840; without 16492 itself that is 19348, so 16492 is abundant (19348 is more than 16492). Euler's totient φ(16492) = 6480 numbers up to 16492 share no factor with it.
- 4
The digits of 16492 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16492 = 2^{2} \times 7 \times 19 \times 31 \]16492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 35840 |
| Euler totient φ(n) | 6480 |
| Square | 271986064 |
| Cube | 4485594167488 |
| Square root | 128.421182 (= 2√4123) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.6492 × |
16492 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand four hundred and ninety-two |
| Binary (base 2) | 100000001101100 |
| Octal (base 8) | 40154 |
| Hexadecimal (base 16) | 406C |
| Base 3 | 211121211 |
| As time | 16492 seconds = 4 h 34 min 52 s |
Is 16492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16492 ÷ 2 = 8246) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16492 ÷ 4 = 4123) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (16492 ÷ 7 = 2356) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16492 a prime number?
No. 16492 = × 7 × 19 × 31, so it is divisible by 2.
What are the factors of 16492?
1, 2, 4, 7, 14, 19, 28, 31, 38, 62, 76, 124, 133, 217, 266, 434, 532, 589, 868, 1178, 2356, 4123, 8246, 16492.
What is 16492 in binary?
100000001101100 (hexadecimal 406C, octal 40154).
What is the square root of 16492?
About 128.4212, exactly 2√4123.
Is 16492 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 16492?
It is a composite number with 24 divisors.