The number 90732
90732 is a composite number with 12 divisors. Its prime factorisation is × 3 × 7561. Divisors (12): 1, 2, 3, 4, 6, 12, 7561, 15122, 22683, 30244, 45366, 90732.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90732 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90732 is composite. Its prime factorisation is
- 3
The divisors add up to 211736; without 90732 itself that is 121004, so 90732 is abundant (121004 is more than 90732). Euler's totient φ(90732) = 30240 numbers up to 90732 share no factor with it.
- 4
The digits of 90732 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90732 = 2^{2} \times 3 \times 7561 \]90732 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 211736 |
| Euler totient φ(n) | 30240 |
| Square | 8232295824 |
| Cube | 746932664703168 |
| Square root | 301.217529 (= 2√22683) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.0732 × |
90732 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand seven hundred and thirty-two |
| Binary (base 2) | 10110001001101100 |
| Octal (base 8) | 261154 |
| Hexadecimal (base 16) | 1626C |
| Base 3 | 11121110110 |
| As time | 90732 seconds = 25 h 12 min 12 s |
Is 90732 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90732 ÷ 2 = 45366) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (90732 ÷ 3 = 30244) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (90732 ÷ 4 = 22683) | 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 | Yes (90732 ÷ 6 = 15122) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (90732 ÷ 12 = 7561) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90732 a prime number?
No. 90732 = × 3 × 7561, so it is divisible by 2.
What are the factors of 90732?
1, 2, 3, 4, 6, 12, 7561, 15122, 22683, 30244, 45366, 90732.
What is 90732 in binary?
10110001001101100 (hexadecimal 1626C, octal 261154).
What is the square root of 90732?
About 301.2175, exactly 2√22683.
Is 90732 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 90732?
It is a composite number with 12 divisors.