The number 89561
89561 is a twin prime (89561 and 89563 are both prime) and the 8672nd prime number. Its only divisors are 1 and 89561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89561: a twin prime (89561 and 89563 are both prime); the 8672nd prime number.
- 2
89561 is prime, so its only factors are 1 and 89561. It is the 8672nd prime; the next prime is 89563 and the one before is 89533.
- 3
The divisors add up to 89562; without 89561 itself that is 1, so 89561 is deficient (1 is less than 89561). Euler's totient φ(89561) = 89560 numbers up to 89561 share no factor with it.
- 4
The digits of 89561 add up to 29, 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.
89561 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 89562 |
| Euler totient φ(n) | 89560 |
| Square | 8021172721 |
| Cube | 718384250065481 |
| Square root | 299.267439 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.9561 × |
89561 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand five hundred and sixty-one |
| Binary (base 2) | 10101110111011001 |
| Octal (base 8) | 256731 |
| Hexadecimal (base 16) | 15DD9 |
| Base 3 | 11112212002 |
| As time | 89561 seconds = 24 h 52 min 41 s |
Is 89561 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 3) | 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 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 10) | 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 89561 a prime number?
Yes. 89561 is divisible only by 1 and itself.
What are the factors of 89561?
1, 89561.
What is 89561 in binary?
10101110111011001 (hexadecimal 15DD9, octal 256731).
What is the square root of 89561?
About 299.2674.
Is 89561 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 89561?
89561 is a twin prime (89561 and 89563 are both prime); the 8672nd prime number.