The number 90364
90364 is a composite number with 24 divisors. Its prime factorisation is × 19 × 29 × 41. Divisors (24): 1, 2, 4, 19, 29, 38, 41, 58, 76, 82, 116, 164, 551, 779, 1102, 1189 … 90364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90364 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90364 is composite. Its prime factorisation is
- 3
The divisors add up to 176400; without 90364 itself that is 86036, so 90364 is deficient (86036 is less than 90364). Euler's totient φ(90364) = 40320 numbers up to 90364 share no factor with it.
- 4
The digits of 90364 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90364 = 2^{2} \times 19 \times 29 \times 41 \]90364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 176400 |
| Euler totient φ(n) | 40320 |
| Square | 8165652496 |
| Cube | 737881022148544 |
| Square root | 300.606054 (= 2√22591) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0364 × |
90364 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and sixty-four |
| Binary (base 2) | 10110000011111100 |
| Octal (base 8) | 260374 |
| Hexadecimal (base 16) | 160FC |
| Base 3 | 11120221211 |
| As time | 90364 seconds = 25 h 6 min 4 s |
Is 90364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90364 ÷ 2 = 45182) | 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 | Yes (90364 ÷ 4 = 22591) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90364 a prime number?
No. 90364 = × 19 × 29 × 41, so it is divisible by 2.
What are the factors of 90364?
1, 2, 4, 19, 29, 38, 41, 58, 76, 82, 116, 164, 551, 779, 1102, 1189, 1558, 2204, 2378, 3116, 4756, 22591, 45182, 90364.
What is 90364 in binary?
10110000011111100 (hexadecimal 160FC, octal 260374).
What is the square root of 90364?
About 300.6061, exactly 2√22591.
Is 90364 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 90364?
It is a composite number with 24 divisors.