The number 90331
90331 is a composite number with 4 divisors. Its prime factorisation is 103 × 877. Divisors (4): 1, 103, 877, 90331.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90331: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 103 × 877, the product of two primes.
- 2
90331 is composite. Its prime factorisation is
- 3
The divisors add up to 91312; without 90331 itself that is 981, so 90331 is deficient (981 is less than 90331). Euler's totient φ(90331) = 89352 numbers up to 90331 share no factor with it.
- 4
The digits of 90331 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90331 = 103 \times 877 \]
90331 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 91312 |
| Euler totient φ(n) | 89352 |
| Square | 8159689561 |
| Cube | 737072917734691 |
| Square root | 300.551160 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 45 |
| Scientific notation | 9.0331 × |
90331 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand three hundred and thirty-one |
| Binary (base 2) | 10110000011011011 |
| Octal (base 8) | 260333 |
| Hexadecimal (base 16) | 160DB |
| Base 3 | 11120220121 |
| As time | 90331 seconds = 25 h 5 min 31 s |
Is 90331 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90331 a prime number?
No. 90331 = 103 × 877, so it is divisible by 103.
What are the factors of 90331?
1, 103, 877, 90331.
What is 90331 in binary?
10110000011011011 (hexadecimal 160DB, octal 260333).
What is the square root of 90331?
About 300.5512.
Is 90331 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 90331?
90331 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 103 × 877, the product of two primes.