The number 90381
90381 is a binary palindrome (10110000100001101). Its prime factorisation is 3 × 47 × 641. Divisors (8): 1, 3, 47, 141, 641, 1923, 30127, 90381.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90381: a binary palindrome (10110000100001101).
- 2
90381 is composite. Its prime factorisation is
- 3
The divisors add up to 123264; without 90381 itself that is 32883, so 90381 is deficient (32883 is less than 90381). Euler's totient φ(90381) = 58880 numbers up to 90381 share no factor with it.
- 4
The digits of 90381 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90381 = 3 \times 47 \times 641 \]
90381 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 123264 |
| Euler totient φ(n) | 58880 |
| Square | 8168725161 |
| Cube | 738297548776341 |
| Square root | 300.634329 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0381 × |
90381 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and eighty-one |
| Binary (base 2) | 10110000100001101 |
| Octal (base 8) | 260415 |
| Hexadecimal (base 16) | 1610D |
| Base 3 | 11120222110 |
| As time | 90381 seconds = 25 h 6 min 21 s |
Is 90381 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 | Yes (90381 ÷ 3 = 30127) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 5) | 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 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90381 a prime number?
No. 90381 = 3 × 47 × 641, so it is divisible by 3.
What are the factors of 90381?
1, 3, 47, 141, 641, 1923, 30127, 90381.
What is 90381 in binary?
10110000100001101 (hexadecimal 1610D, octal 260415).
What is the square root of 90381?
About 300.6343.
Is 90381 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 90381?
90381 is a binary palindrome (10110000100001101).