The number 16501
16501 is a composite number with 4 divisors. Its prime factorisation is 29 × 569. Divisors (4): 1, 29, 569, 16501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16501: a semiprime: 29 × 569, the product of two primes.
- 2
16501 is composite. Its prime factorisation is
- 3
The divisors add up to 17100; without 16501 itself that is 599, so 16501 is deficient (599 is less than 16501). Euler's totient φ(16501) = 15904 numbers up to 16501 share no factor with it.
- 4
The digits of 16501 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16501 = 29 \times 569 \]
16501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17100 |
| Euler totient φ(n) | 15904 |
| Square | 272283001 |
| Cube | 4492941799501 |
| Square root | 128.456218 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.6501 × |
16501 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and one |
| Binary (base 2) | 100000001110101 |
| Octal (base 8) | 40165 |
| Hexadecimal (base 16) | 4075 |
| Base 3 | 211122011 |
| As time | 16501 seconds = 4 h 35 min 1 s |
Is 16501 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 1) | 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 2) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 16501 a prime number?
No. 16501 = 29 × 569, so it is divisible by 29.
What are the factors of 16501?
1, 29, 569, 16501.
What is 16501 in binary?
100000001110101 (hexadecimal 4075, octal 40165).
What is the square root of 16501?
About 128.4562.
Is 16501 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 16501?
16501 is a semiprime: 29 × 569, the product of two primes.