The number 16503
16503 is a composite number with 4 divisors. Its prime factorisation is 3 × 5501. Divisors (4): 1, 3, 5501, 16503.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16503: a semiprime: 3 × 5501, the product of two primes.
- 2
16503 is composite. Its prime factorisation is
- 3
The divisors add up to 22008; without 16503 itself that is 5505, so 16503 is deficient (5505 is less than 16503). Euler's totient φ(16503) = 11000 numbers up to 16503 share no factor with it.
- 4
The digits of 16503 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16503 = 3 \times 5501 \]
16503 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22008 |
| Euler totient φ(n) | 11000 |
| Square | 272349009 |
| Cube | 4494575695527 |
| Square root | 128.464003 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 66 |
| Scientific notation | 1.6503 × |
16503 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and three |
| Binary (base 2) | 100000001110111 |
| Octal (base 8) | 40167 |
| Hexadecimal (base 16) | 4077 |
| Base 3 | 211122020 |
| As time | 16503 seconds = 4 h 35 min 3 s |
Is 16503 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 | Yes (16503 ÷ 3 = 5501) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16503 a prime number?
No. 16503 = 3 × 5501, so it is divisible by 3.
What are the factors of 16503?
1, 3, 5501, 16503.
What is 16503 in binary?
100000001110111 (hexadecimal 4077, octal 40167).
What is the square root of 16503?
About 128.4640.
Is 16503 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 16503?
16503 is a semiprime: 3 × 5501, the product of two primes.