The number 89961
89961 is a composite number with 8 divisors. Its prime factorisation is 3 × 157 × 191. Divisors (8): 1, 3, 157, 191, 471, 573, 29987, 89961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89961: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
89961 is composite. Its prime factorisation is
- 3
The divisors add up to 121344; without 89961 itself that is 31383, so 89961 is deficient (31383 is less than 89961). Euler's totient φ(89961) = 59280 numbers up to 89961 share no factor with it.
- 4
The digits of 89961 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89961 = 3 \times 157 \times 191 \]
89961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 121344 |
| Euler totient φ(n) | 59280 |
| Square | 8092981521 |
| Cube | 728052710610681 |
| Square root | 299.934993 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 8.9961 × |
89961 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand nine hundred and sixty-one |
| Binary (base 2) | 10101111101101001 |
| Octal (base 8) | 257551 |
| Hexadecimal (base 16) | 15F69 |
| Base 3 | 11120101220 |
| As time | 89961 seconds = 24 h 59 min 21 s |
Is 89961 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 | Yes (89961 ÷ 3 = 29987) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89961 a prime number?
No. 89961 = 3 × 157 × 191, so it is divisible by 3.
What are the factors of 89961?
1, 3, 157, 191, 471, 573, 29987, 89961.
What is 89961 in binary?
10101111101101001 (hexadecimal 15F69, octal 257551).
What is the square root of 89961?
About 299.9350.
Is 89961 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 89961?
89961 is a happy number: repeatedly adding the squares of its digits reaches 1.