The number 14251
14251 is a twin prime (14249 and 14251 are both prime) and the 1675th prime number. Its only divisors are 1 and 14251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14251: a twin prime (14249 and 14251 are both prime); the 1675th prime number.
- 2
14251 is prime, so its only factors are 1 and 14251. It is the 1675th prime; the next prime is 14281 and the one before is 14249.
- 3
The divisors add up to 14252; without 14251 itself that is 1, so 14251 is deficient (1 is less than 14251). Euler's totient φ(14251) = 14250 numbers up to 14251 share no factor with it.
- 4
The digits of 14251 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 50 steps to reach 1.
14251 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 14252 |
| Euler totient φ(n) | 14250 |
| Square | 203091001 |
| Cube | 2894249855251 |
| Square root | 119.377552 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.4251 × |
14251 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand two hundred and fifty-one |
| Binary (base 2) | 11011110101011 |
| Octal (base 8) | 33653 |
| Hexadecimal (base 16) | 37AB |
| Base 3 | 201112211 |
| As time | 14251 seconds = 3 h 57 min 31 s |
Is 14251 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 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 3) | 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 6) | 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 14251 a prime number?
Yes. 14251 is divisible only by 1 and itself.
What are the factors of 14251?
1, 14251.
What is 14251 in binary?
11011110101011 (hexadecimal 37AB, octal 33653).
What is the square root of 14251?
About 119.3776.
Is 14251 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 14251?
14251 is a twin prime (14249 and 14251 are both prime); the 1675th prime number.