The number 36832
36832 is a composite number with 12 divisors. Its prime factorisation is × 1151. Divisors (12): 1, 2, 4, 8, 16, 32, 1151, 2302, 4604, 9208, 18416, 36832.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36832 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36832 is composite. Its prime factorisation is
- 3
The divisors add up to 72576; without 36832 itself that is 35744, so 36832 is deficient (35744 is less than 36832). Euler's totient φ(36832) = 18400 numbers up to 36832 share no factor with it.
- 4
The digits of 36832 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36832 = 2^{5} \times 1151 \]36832 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 72576 |
| Euler totient φ(n) | 18400 |
| Square | 1356596224 |
| Cube | 49966152122368 |
| Square root | 191.916649 (= 4√2302) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 62 |
| Scientific notation | 3.6832 × |
36832 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand eight hundred and thirty-two |
| Binary (base 2) | 1000111111100000 |
| Octal (base 8) | 107740 |
| Hexadecimal (base 16) | 8FE0 |
| Base 3 | 1212112011 |
| As time | 36832 seconds = 10 h 13 min 52 s |
Is 36832 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36832 ÷ 2 = 18416) | 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 (36832 ÷ 4 = 9208) | 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 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 | Yes (36832 ÷ 8 = 4604) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36832 a prime number?
No. 36832 = × 1151, so it is divisible by 2.
What are the factors of 36832?
1, 2, 4, 8, 16, 32, 1151, 2302, 4604, 9208, 18416, 36832.
What is 36832 in binary?
1000111111100000 (hexadecimal 8FE0, octal 107740).
What is the square root of 36832?
About 191.9166, exactly 4√2302.
Is 36832 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 36832?
It is a composite number with 12 divisors.