The number 89291
89291 is a composite number with 4 divisors. Its prime factorisation is 29 × 3079. Divisors (4): 1, 29, 3079, 89291.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89291: a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 3079, the product of two primes.
- 2
89291 is composite. Its prime factorisation is
- 3
The divisors add up to 92400; without 89291 itself that is 3109, so 89291 is deficient (3109 is less than 89291). Euler's totient φ(89291) = 86184 numbers up to 89291 share no factor with it.
- 4
The digits of 89291 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89291 = 29 \times 3079 \]
89291 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92400 |
| Euler totient φ(n) | 86184 |
| Square | 7972882681 |
| Cube | 711906667469171 |
| Square root | 298.815997 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 115 |
| Scientific notation | 8.9291 × |
89291 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand two hundred and ninety-one |
| Binary (base 2) | 10101110011001011 |
| Octal (base 8) | 256313 |
| Hexadecimal (base 16) | 15CCB |
| Base 3 | 11112111002 |
| As time | 89291 seconds = 24 h 48 min 11 s |
Is 89291 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 3) | 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 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 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89291 a prime number?
No. 89291 = 29 × 3079, so it is divisible by 29.
What are the factors of 89291?
1, 29, 3079, 89291.
What is 89291 in binary?
10101110011001011 (hexadecimal 15CCB, octal 256313).
What is the square root of 89291?
About 298.8160.
Is 89291 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 89291?
89291 is a Harshad number: divisible by its digit sum 29; a semiprime: 29 × 3079, the product of two primes.