The number 90501
90501 is a composite number with 8 divisors. Its prime factorisation is 3 × 97 × 311. Divisors (8): 1, 3, 97, 291, 311, 933, 30167, 90501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90501 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90501 is composite. Its prime factorisation is
- 3
The divisors add up to 122304; without 90501 itself that is 31803, so 90501 is deficient (31803 is less than 90501). Euler's totient φ(90501) = 59520 numbers up to 90501 share no factor with it.
- 4
The digits of 90501 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90501 = 3 \times 97 \times 311 \]
90501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 122304 |
| Euler totient φ(n) | 59520 |
| Square | 8190431001 |
| Cube | 741242196021501 |
| Square root | 300.833841 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 89 |
| Scientific notation | 9.0501 × |
90501 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and one |
| Binary (base 2) | 10110000110000101 |
| Octal (base 8) | 260605 |
| Hexadecimal (base 16) | 16185 |
| Base 3 | 11121010220 |
| As time | 90501 seconds = 25 h 8 min 21 s |
Is 90501 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 (90501 ÷ 3 = 30167) | 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 5) | 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 6) | 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 4) | 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 90501 a prime number?
No. 90501 = 3 × 97 × 311, so it is divisible by 3.
What are the factors of 90501?
1, 3, 97, 291, 311, 933, 30167, 90501.
What is 90501 in binary?
10110000110000101 (hexadecimal 16185, octal 260605).
What is the square root of 90501?
About 300.8338.
Is 90501 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 90501?
It is a composite number with 8 divisors.