The number 36352
36352 is a composite number with 20 divisors. Its prime factorisation is × 71. Divisors (20): 1, 2, 4, 8, 16, 32, 64, 71, 128, 142, 256, 284, 512, 568, 1136, 2272 … 36352.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36352 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36352 is composite. Its prime factorisation is
- 3
The divisors add up to 73656; without 36352 itself that is 37304, so 36352 is abundant (37304 is more than 36352). Euler's totient φ(36352) = 17920 numbers up to 36352 share no factor with it.
- 4
The digits of 36352 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 111 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36352 = 2^{9} \times 71 \]36352 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 73656 |
| Euler totient φ(n) | 17920 |
| Square | 1321467904 |
| Cube | 48038001246208 |
| Square root | 190.662005 (= 16√142) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 111 |
| Scientific notation | 3.6352 × |
36352 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand three hundred and fifty-two |
| Binary (base 2) | 1000111000000000 |
| Octal (base 8) | 107000 |
| Hexadecimal (base 16) | 8E00 |
| Base 3 | 1211212101 |
| As time | 36352 seconds = 10 h 5 min 52 s |
Is 36352 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36352 ÷ 2 = 18176) | 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 (36352 ÷ 4 = 9088) | 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 | Yes (36352 ÷ 8 = 4544) | 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 8) | 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 36352 a prime number?
No. 36352 = × 71, so it is divisible by 2.
What are the factors of 36352?
1, 2, 4, 8, 16, 32, 64, 71, 128, 142, 256, 284, 512, 568, 1136, 2272, 4544, 9088, 18176, 36352.
What is 36352 in binary?
1000111000000000 (hexadecimal 8E00, octal 107000).
What is the square root of 36352?
About 190.6620, exactly 16√142.
Is 36352 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 36352?
It is a composite number with 20 divisors.