The number 89947
89947 is a composite number with 16 divisors. Its prime factorisation is 11 × 13 × 17 × 37. Divisors (16): 1, 11, 13, 17, 37, 143, 187, 221, 407, 481, 629, 2431, 5291, 6919, 8177, 89947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 89947: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 37.
- 2
89947 is composite. Its prime factorisation is
- 3
The divisors add up to 114912; without 89947 itself that is 24965, so 89947 is deficient (24965 is less than 89947). Euler's totient φ(89947) = 69120 numbers up to 89947 share no factor with it.
- 4
The digits of 89947 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89947 = 11 \times 13 \times 17 \times 37 \]
89947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 114912 |
| Euler totient φ(n) | 69120 |
| Square | 8090462809 |
| Cube | 727712858281123 |
| Square root | 299.911654 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 164 |
| Scientific notation | 8.9947 × |
89947 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand nine hundred and forty-seven |
| Binary (base 2) | 10101111101011011 |
| Octal (base 8) | 257533 |
| Hexadecimal (base 16) | 15F5B |
| Base 3 | 11120101101 |
| As time | 89947 seconds = 24 h 59 min 7 s |
Is 89947 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (89947 ÷ 11 = 8177) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89947 a prime number?
No. 89947 = 11 × 13 × 17 × 37, so it is divisible by 11.
What are the factors of 89947?
1, 11, 13, 17, 37, 143, 187, 221, 407, 481, 629, 2431, 5291, 6919, 8177, 89947.
What is 89947 in binary?
10101111101011011 (hexadecimal 15F5B, octal 257533).
What is the square root of 89947?
About 299.9117.
Is 89947 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 89947?
89947 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 37.