The number 36952
36952 is a composite number with 16 divisors. Its prime factorisation is × 31 × 149. Divisors (16): 1, 2, 4, 8, 31, 62, 124, 149, 248, 298, 596, 1192, 4619, 9238, 18476, 36952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36952 is composite. Its prime factorisation is
- 3
The divisors add up to 72000; without 36952 itself that is 35048, so 36952 is deficient (35048 is less than 36952). Euler's totient φ(36952) = 17760 numbers up to 36952 share no factor with it.
- 4
The digits of 36952 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36952 = 2^{3} \times 31 \times 149 \]36952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 72000 |
| Euler totient φ(n) | 17760 |
| Square | 1365450304 |
| Cube | 50456119633408 |
| Square root | 192.229030 (= 2√9238) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6952 × |
36952 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and fifty-two |
| Binary (base 2) | 1001000001011000 |
| Octal (base 8) | 110130 |
| Hexadecimal (base 16) | 9058 |
| Base 3 | 1212200121 |
| As time | 36952 seconds = 10 h 15 min 52 s |
Is 36952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36952 ÷ 2 = 18476) | 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 (36952 ÷ 4 = 9238) | 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 6) | 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 (36952 ÷ 8 = 4619) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36952 a prime number?
No. 36952 = × 31 × 149, so it is divisible by 2.
What are the factors of 36952?
1, 2, 4, 8, 31, 62, 124, 149, 248, 298, 596, 1192, 4619, 9238, 18476, 36952.
What is 36952 in binary?
1001000001011000 (hexadecimal 9058, octal 110130).
What is the square root of 36952?
About 192.2290, exactly 2√9238.
Is 36952 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 36952?
It is a composite number with 16 divisors.