The number 89903
89903 is a composite number with 6 divisors. Its prime factorisation is Ć 743. Divisors (6): 1, 11, 121, 743, 8173, 89903.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
89903 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
89903 is composite. Its prime factorisation is
- 3
The divisors add up to 98952; without 89903 itself that is 9049, so 89903 is deficient (9049 is less than 89903). Euler's totient Ļ(89903) = 81620 numbers up to 89903 share no factor with it.
- 4
The digits of 89903 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 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 89903 = 11^{2} \times 743 \]89903 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 98952 |
| Euler totient Ļ(n) | 81620 |
| Square | 8082549409 |
| Cube | 726645439517327 |
| Square root | 299.838290 (= 11ā743) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 164 |
| Scientific notation | 8.9903 Ć |
89903 in other forms
| Form | Value |
|---|---|
| In words | eighty-nine thousand nine hundred and three |
| Binary (base 2) | 10101111100101111 |
| Octal (base 8) | 257457 |
| Hexadecimal (base 16) | 15F2F |
| Base 3 | 11120022202 |
| As time | 89903 seconds = 24 h 58 min 23 s |
Is 89903 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 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 7) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (89903 Ć· 11 = 8173) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 89903 a prime number?
No. 89903 = Ć 743, so it is divisible by 11.
What are the factors of 89903?
1, 11, 121, 743, 8173, 89903.
What is 89903 in binary?
10101111100101111 (hexadecimal 15F2F, octal 257457).
What is the square root of 89903?
About 299.8383, exactly 11ā743.
Is 89903 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 89903?
It is a composite number with 6 divisors.