The number 90237
90237 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 4297. Divisors (8): 1, 3, 7, 21, 4297, 12891, 30079, 90237.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90237: a Harshad number: divisible by its digit sum 21.
- 2
90237 is composite. Its prime factorisation is
- 3
The divisors add up to 137536; without 90237 itself that is 47299, so 90237 is deficient (47299 is less than 90237). Euler's totient φ(90237) = 51552 numbers up to 90237 share no factor with it.
- 4
The digits of 90237 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 270 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90237 = 3 \times 7 \times 4297 \]
90237 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 137536 |
| Euler totient φ(n) | 51552 |
| Square | 8142716169 |
| Cube | 734774278942053 |
| Square root | 300.394740 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 270 |
| Scientific notation | 9.0237 × |
90237 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand two hundred and thirty-seven |
| Binary (base 2) | 10110000001111101 |
| Octal (base 8) | 260175 |
| Hexadecimal (base 16) | 1607D |
| Base 3 | 11120210010 |
| As time | 90237 seconds = 25 h 3 min 57 s |
Is 90237 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 (90237 ÷ 3 = 30079) | 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 2) | 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 | Yes (90237 ÷ 7 = 12891) | 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 7) | 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 90237 a prime number?
No. 90237 = 3 × 7 × 4297, so it is divisible by 3.
What are the factors of 90237?
1, 3, 7, 21, 4297, 12891, 30079, 90237.
What is 90237 in binary?
10110000001111101 (hexadecimal 1607D, octal 260175).
What is the square root of 90237?
About 300.3947.
Is 90237 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 90237?
90237 is a Harshad number: divisible by its digit sum 21.