The number 16489
16489 is a composite number with 4 divisors. Its prime factorisation is 11 × 1499. Divisors (4): 1, 11, 1499, 16489.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16489: a semiprime: 11 × 1499, the product of two primes.
- 2
16489 is composite. Its prime factorisation is
- 3
The divisors add up to 18000; without 16489 itself that is 1511, so 16489 is deficient (1511 is less than 16489). Euler's totient φ(16489) = 14980 numbers up to 16489 share no factor with it.
- 4
The digits of 16489 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16489 = 11 \times 1499 \]
16489 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18000 |
| Euler totient φ(n) | 14980 |
| Square | 271887121 |
| Cube | 4483146738169 |
| Square root | 128.409501 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 159 |
| Scientific notation | 1.6489 × |
16489 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand four hundred and eighty-nine |
| Binary (base 2) | 100000001101001 |
| Octal (base 8) | 40151 |
| Hexadecimal (base 16) | 4069 |
| Base 3 | 211121201 |
| As time | 16489 seconds = 4 h 34 min 49 s |
Is 16489 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 | No (remainder 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (16489 ÷ 11 = 1499) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16489 a prime number?
No. 16489 = 11 × 1499, so it is divisible by 11.
What are the factors of 16489?
1, 11, 1499, 16489.
What is 16489 in binary?
100000001101001 (hexadecimal 4069, octal 40151).
What is the square root of 16489?
About 128.4095.
Is 16489 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 16489?
16489 is a semiprime: 11 × 1499, the product of two primes.