The number 36732
36732 is a composite number with 12 divisors. Its prime factorisation is × 3 × 3061. Divisors (12): 1, 2, 3, 4, 6, 12, 3061, 6122, 9183, 12244, 18366, 36732.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36732 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36732 is composite. Its prime factorisation is
- 3
The divisors add up to 85736; without 36732 itself that is 49004, so 36732 is abundant (49004 is more than 36732). Euler's totient φ(36732) = 12240 numbers up to 36732 share no factor with it.
- 4
The digits of 36732 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 173 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36732 = 2^{2} \times 3 \times 3061 \]36732 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 85736 |
| Euler totient φ(n) | 12240 |
| Square | 1349239824 |
| Cube | 49560277215168 |
| Square root | 191.655942 (= 2√9183) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 173 |
| Scientific notation | 3.6732 × |
36732 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand seven hundred and thirty-two |
| Binary (base 2) | 1000111101111100 |
| Octal (base 8) | 107574 |
| Hexadecimal (base 16) | 8F7C |
| Base 3 | 1212101110 |
| As time | 36732 seconds = 10 h 12 min 12 s |
Is 36732 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36732 ÷ 2 = 18366) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (36732 ÷ 3 = 12244) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (36732 ÷ 4 = 9183) | 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 (36732 ÷ 6 = 6122) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (36732 ÷ 12 = 3061) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36732 a prime number?
No. 36732 = × 3 × 3061, so it is divisible by 2.
What are the factors of 36732?
1, 2, 3, 4, 6, 12, 3061, 6122, 9183, 12244, 18366, 36732.
What is 36732 in binary?
1000111101111100 (hexadecimal 8F7C, octal 107574).
What is the square root of 36732?
About 191.6559, exactly 2√9183.
Is 36732 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 36732?
It is a composite number with 12 divisors.