The number 14951
14951 is the 1751st prime number. Its only divisors are 1 and 14951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14951: the 1751st prime number.
- 2
14951 is prime, so its only factors are 1 and 14951. It is the 1751st prime; the next prime is 14957 and the one before is 14947.
- 3
The divisors add up to 14952; without 14951 itself that is 1, so 14951 is deficient (1 is less than 14951). Euler's totient φ(14951) = 14950 numbers up to 14951 share no factor with it.
- 4
The digits of 14951 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
14951 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 14952 |
| Euler totient φ(n) | 14950 |
| Square | 223532401 |
| Cube | 3342032927351 |
| Square root | 122.274282 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4951 × |
14951 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and fifty-one |
| Binary (base 2) | 11101001100111 |
| Octal (base 8) | 35147 |
| Hexadecimal (base 16) | 3A67 |
| Base 3 | 202111202 |
| As time | 14951 seconds = 4 h 9 min 11 s |
Is 14951 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 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 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 2) | 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 14951 a prime number?
Yes. 14951 is divisible only by 1 and itself.
What are the factors of 14951?
1, 14951.
What is 14951 in binary?
11101001100111 (hexadecimal 3A67, octal 35147).
What is the square root of 14951?
About 122.2743.
Is 14951 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14951?
14951 is the 1751st prime number.