The number 16483
16483 is a composite number with 4 divisors. Its prime factorisation is 53 × 311. Divisors (4): 1, 53, 311, 16483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16483: a semiprime: 53 × 311, the product of two primes.
- 2
16483 is composite. Its prime factorisation is
- 3
The divisors add up to 16848; without 16483 itself that is 365, so 16483 is deficient (365 is less than 16483). Euler's totient φ(16483) = 16120 numbers up to 16483 share no factor with it.
- 4
The digits of 16483 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 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16483 = 53 \times 311 \]
16483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16848 |
| Euler totient φ(n) | 16120 |
| Square | 271689289 |
| Cube | 4478254550587 |
| Square root | 128.386136 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 66 |
| Scientific notation | 1.6483 × |
16483 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand four hundred and eighty-three |
| Binary (base 2) | 100000001100011 |
| Octal (base 8) | 40143 |
| Hexadecimal (base 16) | 4063 |
| Base 3 | 211121111 |
| As time | 16483 seconds = 4 h 34 min 43 s |
Is 16483 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 5) | 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 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16483 a prime number?
No. 16483 = 53 × 311, so it is divisible by 53.
What are the factors of 16483?
1, 53, 311, 16483.
What is 16483 in binary?
100000001100011 (hexadecimal 4063, octal 40143).
What is the square root of 16483?
About 128.3861.
Is 16483 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 16483?
16483 is a semiprime: 53 × 311, the product of two primes.