The number 89568
89568 is a composite number with 36 divisors. Its prime factorisation is × × 311. Divisors (36): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 72, 96 … 89568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89568: a Harshad number: divisible by its digit sum 36.
- 2
89568 is composite. Its prime factorisation is
- 3
The divisors add up to 255528; without 89568 itself that is 165960, so 89568 is abundant (165960 is more than 89568). Euler's totient φ(89568) = 29760 numbers up to 89568 share no factor with it.
- 4
The digits of 89568 add up to 36, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89568 = 2^{5} \times 3^{2} \times 311 \]89568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 255528 |
| Euler totient φ(n) | 29760 |
| Square | 8022426624 |
| Cube | 718552707858432 |
| Square root | 299.279134 (= 12√622) |
| Digit sum / digital root | 36 / 9 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.9568 × |
89568 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand five hundred and sixty-eight |
| Binary (base 2) | 10101110111100000 |
| Octal (base 8) | 256740 |
| Hexadecimal (base 16) | 15DE0 |
| Base 3 | 11112212100 |
| As time | 89568 seconds = 24 h 52 min 48 s |
Is 89568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (89568 ÷ 2 = 44784) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (89568 ÷ 3 = 29856) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (89568 ÷ 4 = 22392) | 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 | Yes (89568 ÷ 6 = 14928) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (89568 ÷ 8 = 11196) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (89568 ÷ 9 = 9952) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (89568 ÷ 12 = 7464) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89568 a prime number?
No. 89568 = × × 311, so it is divisible by 2.
What are the factors of 89568?
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 32, 36, 48, 72, 96, 144, 288, 311, 622, 933, 1244, 1866, 2488, 2799, 3732, 4976, 5598, 7464, 9952, 11196, 14928, 22392, 29856, 44784, 89568.
What is 89568 in binary?
10101110111100000 (hexadecimal 15DE0, octal 256740).
What is the square root of 89568?
About 299.2791, exactly 12√622.
Is 89568 divisible by 3?
Yes. Its digits add up to 36, a multiple of 3.
What is special about the number 89568?
89568 is a Harshad number: divisible by its digit sum 36.