The number 16601
16601 is a composite number with 4 divisors. Its prime factorisation is 13 × 1277. Divisors (4): 1, 13, 1277, 16601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16601: a semiprime: 13 × 1277, the product of two primes.
- 2
16601 is composite. Its prime factorisation is
- 3
The divisors add up to 17892; without 16601 itself that is 1291, so 16601 is deficient (1291 is less than 16601). Euler's totient φ(16601) = 15312 numbers up to 16601 share no factor with it.
- 4
The digits of 16601 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16601 = 13 \times 1277 \]
16601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17892 |
| Euler totient φ(n) | 15312 |
| Square | 275593201 |
| Cube | 4575122729801 |
| Square root | 128.844868 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.6601 × |
16601 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand six hundred and one |
| Binary (base 2) | 100000011011001 |
| Octal (base 8) | 40331 |
| Hexadecimal (base 16) | 40D9 |
| Base 3 | 211202212 |
| As time | 16601 seconds = 4 h 36 min 41 s |
Is 16601 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 2) | 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 5) | 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 5) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16601 a prime number?
No. 16601 = 13 × 1277, so it is divisible by 13.
What are the factors of 16601?
1, 13, 1277, 16601.
What is 16601 in binary?
100000011011001 (hexadecimal 40D9, octal 40331).
What is the square root of 16601?
About 128.8449.
Is 16601 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 16601?
16601 is a semiprime: 13 × 1277, the product of two primes.