The number 16701
16701 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 293. Divisors (8): 1, 3, 19, 57, 293, 879, 5567, 16701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16701 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16701 is composite. Its prime factorisation is
- 3
The divisors add up to 23520; without 16701 itself that is 6819, so 16701 is deficient (6819 is less than 16701). Euler's totient φ(16701) = 10512 numbers up to 16701 share no factor with it.
- 4
The digits of 16701 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16701 = 3 \times 19 \times 293 \]
16701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23520 |
| Euler totient φ(n) | 10512 |
| Square | 278923401 |
| Cube | 4658299720101 |
| Square root | 129.232349 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.6701 × |
16701 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand seven hundred and one |
| Binary (base 2) | 100000100111101 |
| Octal (base 8) | 40475 |
| Hexadecimal (base 16) | 413D |
| Base 3 | 211220120 |
| As time | 16701 seconds = 4 h 38 min 21 s |
Is 16701 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 (16701 ÷ 3 = 5567) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16701 a prime number?
No. 16701 = 3 × 19 × 293, so it is divisible by 3.
What are the factors of 16701?
1, 3, 19, 57, 293, 879, 5567, 16701.
What is 16701 in binary?
100000100111101 (hexadecimal 413D, octal 40475).
What is the square root of 16701?
About 129.2323.
Is 16701 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 16701?
It is a composite number with 8 divisors.