The number 90362
90362 is a composite number with 4 divisors. Its prime factorisation is 2 × 45181. Divisors (4): 1, 2, 45181, 90362.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90362: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 45181, the product of two primes.
- 2
90362 is composite. Its prime factorisation is
- 3
The divisors add up to 135546; without 90362 itself that is 45184, so 90362 is deficient (45184 is less than 90362). Euler's totient φ(90362) = 45180 numbers up to 90362 share no factor with it.
- 4
The digits of 90362 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90362 = 2 \times 45181 \]
90362 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 135546 |
| Euler totient φ(n) | 45180 |
| Square | 8165291044 |
| Cube | 737832029317928 |
| Square root | 300.602728 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0362 × |
90362 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and sixty-two |
| Binary (base 2) | 10110000011111010 |
| Octal (base 8) | 260372 |
| Hexadecimal (base 16) | 160FA |
| Base 3 | 11120221202 |
| As time | 90362 seconds = 25 h 6 min 2 s |
Is 90362 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90362 ÷ 2 = 45181) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90362 a prime number?
No. 90362 = 2 × 45181, so it is divisible by 2.
What are the factors of 90362?
1, 2, 45181, 90362.
What is 90362 in binary?
10110000011111010 (hexadecimal 160FA, octal 260372).
What is the square root of 90362?
About 300.6027.
Is 90362 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 90362?
90362 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 45181, the product of two primes.