The number 89048
89048 is a composite number with 8 divisors. Its prime factorisation is × 11131. Divisors (8): 1, 2, 4, 8, 11131, 22262, 44524, 89048.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
89048 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
89048 is composite. Its prime factorisation is
- 3
The divisors add up to 166980; without 89048 itself that is 77932, so 89048 is deficient (77932 is less than 89048). Euler's totient φ(89048) = 44520 numbers up to 89048 share no factor with it.
- 4
The digits of 89048 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89048 = 2^{3} \times 11131 \]89048 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 166980 |
| Euler totient φ(n) | 44520 |
| Square | 7929546304 |
| Cube | 706110239278592 |
| Square root | 298.409115 (= 2√22262) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.9048 × |
89048 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand and forty-eight |
| Binary (base 2) | 10101101111011000 |
| Octal (base 8) | 255730 |
| Hexadecimal (base 16) | 15BD8 |
| Base 3 | 11112011002 |
| As time | 89048 seconds = 24 h 44 min 8 s |
Is 89048 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (89048 ÷ 2 = 44524) | 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 | Yes (89048 ÷ 4 = 22262) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 | Yes (89048 ÷ 8 = 11131) | 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 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89048 a prime number?
No. 89048 = × 11131, so it is divisible by 2.
What are the factors of 89048?
1, 2, 4, 8, 11131, 22262, 44524, 89048.
What is 89048 in binary?
10101101111011000 (hexadecimal 15BD8, octal 255730).
What is the square root of 89048?
About 298.4091, exactly 2√22262.
Is 89048 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 89048?
It is a composite number with 8 divisors.