The number 89461
89461 is a binary palindrome (10101110101110101). Its prime factorisation is 137 × 653. Divisors (4): 1, 137, 653, 89461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89461: a binary palindrome (10101110101110101); a semiprime: 137 × 653, the product of two primes.
- 2
89461 is composite. Its prime factorisation is
- 3
The divisors add up to 90252; without 89461 itself that is 791, so 89461 is deficient (791 is less than 89461). Euler's totient φ(89461) = 88672 numbers up to 89461 share no factor with it.
- 4
The digits of 89461 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89461 = 137 \times 653 \]
89461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 90252 |
| Euler totient φ(n) | 88672 |
| Square | 8003270521 |
| Cube | 715980584079181 |
| Square root | 299.100318 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.9461 × |
89461 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand four hundred and sixty-one |
| Binary (base 2) | 10101110101110101 |
| Octal (base 8) | 256565 |
| Hexadecimal (base 16) | 15D75 |
| Base 3 | 11112201101 |
| As time | 89461 seconds = 24 h 51 min 1 s |
Is 89461 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 9) | 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 89461 a prime number?
No. 89461 = 137 × 653, so it is divisible by 137.
What are the factors of 89461?
1, 137, 653, 89461.
What is 89461 in binary?
10101110101110101 (hexadecimal 15D75, octal 256565).
What is the square root of 89461?
About 299.1003.
Is 89461 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 89461?
89461 is a binary palindrome (10101110101110101); a semiprime: 137 × 653, the product of two primes.