The number 14461
14461 is the 1696th prime number. Its only divisors are 1 and 14461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14461: the 1696th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14461 is prime, so its only factors are 1 and 14461. It is the 1696th prime; the next prime is 14479 and the one before is 14449.
- 3
The divisors add up to 14462; without 14461 itself that is 1, so 14461 is deficient (1 is less than 14461). Euler's totient φ(14461) = 14460 numbers up to 14461 share no factor with it.
- 4
The digits of 14461 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
14461 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 14462 |
| Euler totient φ(n) | 14460 |
| Square | 209120521 |
| Cube | 3024091854181 |
| Square root | 120.253898 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4461 × |
14461 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and sixty-one |
| Binary (base 2) | 11100001111101 |
| Octal (base 8) | 34175 |
| Hexadecimal (base 16) | 387D |
| Base 3 | 201211121 |
| As time | 14461 seconds = 4 h 1 min 1 s |
Is 14461 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14461 a prime number?
Yes. 14461 is divisible only by 1 and itself.
What are the factors of 14461?
1, 14461.
What is 14461 in binary?
11100001111101 (hexadecimal 387D, octal 34175).
What is the square root of 14461?
About 120.2539.
Is 14461 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 14461?
14461 is the 1696th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.