The number 89641
89641 is a composite number with 4 divisors. Its prime factorisation is 17 × 5273. Divisors (4): 1, 17, 5273, 89641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89641: a semiprime: 17 × 5273, the product of two primes.
- 2
89641 is composite. Its prime factorisation is
- 3
The divisors add up to 94932; without 89641 itself that is 5291, so 89641 is deficient (5291 is less than 89641). Euler's totient φ(89641) = 84352 numbers up to 89641 share no factor with it.
- 4
The digits of 89641 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 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89641 = 17 \times 5273 \]
89641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 94932 |
| Euler totient φ(n) | 84352 |
| Square | 8035508881 |
| Cube | 720311051601721 |
| Square root | 299.401069 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 8.9641 × |
89641 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand six hundred and forty-one |
| Binary (base 2) | 10101111000101001 |
| Octal (base 8) | 257051 |
| Hexadecimal (base 16) | 15E29 |
| Base 3 | 11112222001 |
| As time | 89641 seconds = 24 h 54 min 1 s |
Is 89641 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 1) | 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 2) | 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 89641 a prime number?
No. 89641 = 17 × 5273, so it is divisible by 17.
What are the factors of 89641?
1, 17, 5273, 89641.
What is 89641 in binary?
10101111000101001 (hexadecimal 15E29, octal 257051).
What is the square root of 89641?
About 299.4011.
Is 89641 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 89641?
89641 is a semiprime: 17 × 5273, the product of two primes.