The number 89149
89149 is a composite number with 4 divisors. Its prime factorisation is 59 × 1511. Divisors (4): 1, 59, 1511, 89149.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89149: a semiprime: 59 × 1511, the product of two primes.
- 2
89149 is composite. Its prime factorisation is
- 3
The divisors add up to 90720; without 89149 itself that is 1571, so 89149 is deficient (1571 is less than 89149). Euler's totient φ(89149) = 87580 numbers up to 89149 share no factor with it.
- 4
The digits of 89149 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89149 = 59 \times 1511 \]
89149 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 90720 |
| Euler totient φ(n) | 87580 |
| Square | 7947544201 |
| Cube | 708515617974949 |
| Square root | 298.578298 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 133 |
| Scientific notation | 8.9149 × |
89149 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand one hundred and forty-nine |
| Binary (base 2) | 10101110000111101 |
| Octal (base 8) | 256075 |
| Hexadecimal (base 16) | 15C3D |
| Base 3 | 11112021211 |
| As time | 89149 seconds = 24 h 45 min 49 s |
Is 89149 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 4) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 89149 a prime number?
No. 89149 = 59 × 1511, so it is divisible by 59.
What are the factors of 89149?
1, 59, 1511, 89149.
What is 89149 in binary?
10101110000111101 (hexadecimal 15C3D, octal 256075).
What is the square root of 89149?
About 298.5783.
Is 89149 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 89149?
89149 is a semiprime: 59 × 1511, the product of two primes.