The number 89670
89670 is a composite number with 48 divisors. Its prime factorisation is 2 × 3 × 5 × × 61. Divisors (48): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 49, 61, 70 … 89670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89670: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 30.
- 2
89670 is composite. Its prime factorisation is
- 3
The divisors add up to 254448; without 89670 itself that is 164778, so 89670 is abundant (164778 is more than 89670). Euler's totient φ(89670) = 20160 numbers up to 89670 share no factor with it.
- 4
The digits of 89670 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89670 = 2 \times 3 \times 5 \times 7^{2} \times 61 \]89670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 254448 |
| Euler totient φ(n) | 20160 |
| Square | 8040708900 |
| Cube | 721010367063000 |
| Square root | 299.449495 (= 7√1830) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 71 |
| Scientific notation | 8.967 × |
89670 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand six hundred and seventy |
| Binary (base 2) | 10101111001000110 |
| Octal (base 8) | 257106 |
| Hexadecimal (base 16) | 15E46 |
| Base 3 | 11120000010 |
| As time | 89670 seconds = 24 h 54 min 30 s |
Is 89670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (89670 ÷ 2 = 44835) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (89670 ÷ 3 = 29890) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (89670 ÷ 5 = 17934) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (89670 ÷ 6 = 14945) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (89670 ÷ 7 = 12810) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (89670 ÷ 10 = 8967) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89670 a prime number?
No. 89670 = 2 × 3 × 5 × × 61, so it is divisible by 2.
What are the factors of 89670?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 49, 61, 70, 98, 105, 122, 147, 183, 210, 245, 294, 305, 366, 427, 490, 610, 735, 854, 915, 1281, 1470, 1830, 2135, 2562, 2989, 4270, 5978, 6405, 8967, 12810, 14945, 17934, 29890, 44835, 89670.
What is 89670 in binary?
10101111001000110 (hexadecimal 15E46, octal 257106).
What is the square root of 89670?
About 299.4495, exactly 7√1830.
Is 89670 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 89670?
89670 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 30.