The number 14051
14051 is the 1657th prime number. Its only divisors are 1 and 14051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14051: the 1657th prime number.
- 2
14051 is prime, so its only factors are 1 and 14051. It is the 1657th prime; the next prime is 14057 and the one before is 14033.
- 3
The divisors add up to 14052; without 14051 itself that is 1, so 14051 is deficient (1 is less than 14051). Euler's totient φ(14051) = 14050 numbers up to 14051 share no factor with it.
- 4
The digits of 14051 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
14051 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 14052 |
| Euler totient φ(n) | 14050 |
| Square | 197430601 |
| Cube | 2774097374651 |
| Square root | 118.536914 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4051 × |
14051 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand and fifty-one |
| Binary (base 2) | 11011011100011 |
| Octal (base 8) | 33343 |
| Hexadecimal (base 16) | 36E3 |
| Base 3 | 201021102 |
| As time | 14051 seconds = 3 h 54 min 11 s |
Is 14051 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 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14051 a prime number?
Yes. 14051 is divisible only by 1 and itself.
What are the factors of 14051?
1, 14051.
What is 14051 in binary?
11011011100011 (hexadecimal 36E3, octal 33343).
What is the square root of 14051?
About 118.5369.
Is 14051 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 14051?
14051 is the 1657th prime number.