The number 90531
90531 is a composite number with 16 divisors. Its prime factorisation is × 7 × 479. Divisors (16): 1, 3, 7, 9, 21, 27, 63, 189, 479, 1437, 3353, 4311, 10059, 12933, 30177, 90531.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90531 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90531 is composite. Its prime factorisation is
- 3
The divisors add up to 153600; without 90531 itself that is 63069, so 90531 is deficient (63069 is less than 90531). Euler's totient φ(90531) = 51624 numbers up to 90531 share no factor with it.
- 4
The digits of 90531 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90531 = 3^{3} \times 7 \times 479 \]90531 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 153600 |
| Euler totient φ(n) | 51624 |
| Square | 8195861961 |
| Cube | 741979579191291 |
| Square root | 300.883698 (= 3√10059) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.0531 × |
90531 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and thirty-one |
| Binary (base 2) | 10110000110100011 |
| Octal (base 8) | 260643 |
| Hexadecimal (base 16) | 161A3 |
| Base 3 | 11121012000 |
| As time | 90531 seconds = 25 h 8 min 51 s |
Is 90531 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 (90531 ÷ 3 = 30177) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (90531 ÷ 7 = 12933) | 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 | Yes (90531 ÷ 9 = 10059) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90531 a prime number?
No. 90531 = × 7 × 479, so it is divisible by 3.
What are the factors of 90531?
1, 3, 7, 9, 21, 27, 63, 189, 479, 1437, 3353, 4311, 10059, 12933, 30177, 90531.
What is 90531 in binary?
10110000110100011 (hexadecimal 161A3, octal 260643).
What is the square root of 90531?
About 300.8837, exactly 3√10059.
Is 90531 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 90531?
It is a composite number with 16 divisors.