The number 90532
90532 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1741. Divisors (12): 1, 2, 4, 13, 26, 52, 1741, 3482, 6964, 22633, 45266, 90532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90532 is composite. Its prime factorisation is
- 3
The divisors add up to 170716; without 90532 itself that is 80184, so 90532 is deficient (80184 is less than 90532). Euler's totient φ(90532) = 41760 numbers up to 90532 share no factor with it.
- 4
The digits of 90532 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90532 = 2^{2} \times 13 \times 1741 \]90532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 170716 |
| Euler totient φ(n) | 41760 |
| Square | 8196043024 |
| Cube | 742004167048768 |
| Square root | 300.885360 (= 2√22633) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.0532 × |
90532 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and thirty-two |
| Binary (base 2) | 10110000110100100 |
| Octal (base 8) | 260644 |
| Hexadecimal (base 16) | 161A4 |
| Base 3 | 11121012001 |
| As time | 90532 seconds = 25 h 8 min 52 s |
Is 90532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90532 ÷ 2 = 45266) | 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 (90532 ÷ 4 = 22633) | 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 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 1) | 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 2) | 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 90532 a prime number?
No. 90532 = × 13 × 1741, so it is divisible by 2.
What are the factors of 90532?
1, 2, 4, 13, 26, 52, 1741, 3482, 6964, 22633, 45266, 90532.
What is 90532 in binary?
10110000110100100 (hexadecimal 161A4, octal 260644).
What is the square root of 90532?
About 300.8854, exactly 2√22633.
Is 90532 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 90532?
It is a composite number with 12 divisors.