The number 16071
16071 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 487. Divisors (8): 1, 3, 11, 33, 487, 1461, 5357, 16071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16071 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16071 is composite. Its prime factorisation is
- 3
The divisors add up to 23424; without 16071 itself that is 7353, so 16071 is deficient (7353 is less than 16071). Euler's totient φ(16071) = 9720 numbers up to 16071 share no factor with it.
- 4
The digits of 16071 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16071 = 3 \times 11 \times 487 \]
16071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23424 |
| Euler totient φ(n) | 9720 |
| Square | 258277041 |
| Cube | 4150770325911 |
| Square root | 126.771448 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.6071 × |
16071 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand and seventy-one |
| Binary (base 2) | 11111011000111 |
| Octal (base 8) | 37307 |
| Hexadecimal (base 16) | 3EC7 |
| Base 3 | 211001020 |
| As time | 16071 seconds = 4 h 27 min 51 s |
Is 16071 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 (16071 ÷ 3 = 5357) | 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 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 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (16071 ÷ 11 = 1461) | 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 16071 a prime number?
No. 16071 = 3 × 11 × 487, so it is divisible by 3.
What are the factors of 16071?
1, 3, 11, 33, 487, 1461, 5357, 16071.
What is 16071 in binary?
11111011000111 (hexadecimal 3EC7, octal 37307).
What is the square root of 16071?
About 126.7714.
Is 16071 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 16071?
It is a composite number with 8 divisors.