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