The number 14071
14071 is the 1659th prime number. Its only divisors are 1 and 14071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14071: the 1659th prime number.
- 2
14071 is prime, so its only factors are 1 and 14071. It is the 1659th prime; the next prime is 14081 and the one before is 14057.
- 3
The divisors add up to 14072; without 14071 itself that is 1, so 14071 is deficient (1 is less than 14071). Euler's totient φ(14071) = 14070 numbers up to 14071 share no factor with it.
- 4
The digits of 14071 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 107 steps to reach 1.
14071 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 14072 |
| Euler totient φ(n) | 14070 |
| Square | 197993041 |
| Cube | 2785960079911 |
| Square root | 118.621246 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 107 |
| Scientific notation | 1.4071 × |
14071 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and seventy-one |
| Binary (base 2) | 11011011110111 |
| Octal (base 8) | 33367 |
| Hexadecimal (base 16) | 36F7 |
| Base 3 | 201022011 |
| As time | 14071 seconds = 3 h 54 min 31 s |
Is 14071 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14071 a prime number?
Yes. 14071 is divisible only by 1 and itself.
What are the factors of 14071?
1, 14071.
What is 14071 in binary?
11011011110111 (hexadecimal 36F7, octal 33367).
What is the square root of 14071?
About 118.6212.
Is 14071 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 14071?
14071 is the 1659th prime number.