The number 36964
36964 is a composite number with 6 divisors. Its prime factorisation is × 9241. Divisors (6): 1, 2, 4, 9241, 18482, 36964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36964 is composite. Its prime factorisation is
- 3
The divisors add up to 64694; without 36964 itself that is 27730, so 36964 is deficient (27730 is less than 36964). Euler's totient φ(36964) = 18480 numbers up to 36964 share no factor with it.
- 4
The digits of 36964 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36964 = 2^{2} \times 9241 \]36964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 64694 |
| Euler totient φ(n) | 18480 |
| Square | 1366337296 |
| Cube | 50505291809344 |
| Square root | 192.260240 (= 2√9241) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6964 × |
36964 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and sixty-four |
| Binary (base 2) | 1001000001100100 |
| Octal (base 8) | 110144 |
| Hexadecimal (base 16) | 9064 |
| Base 3 | 1212201001 |
| As time | 36964 seconds = 10 h 16 min 4 s |
Is 36964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (36964 ÷ 2 = 18482) | 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 (36964 ÷ 4 = 9241) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 4) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 36964 a prime number?
No. 36964 = × 9241, so it is divisible by 2.
What are the factors of 36964?
1, 2, 4, 9241, 18482, 36964.
What is 36964 in binary?
1001000001100100 (hexadecimal 9064, octal 110144).
What is the square root of 36964?
About 192.2602, exactly 2√9241.
Is 36964 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 36964?
It is a composite number with 6 divisors.