The number 36963
36963 is a palindrome: it reads 36963 backwards too. Its prime factorisation is × . Divisors (12): 1, 3, 9, 27, 37, 111, 333, 999, 1369, 4107, 12321, 36963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 36963: a palindrome: it reads 36963 backwards too; a Harshad number: divisible by its digit sum 27.
- 2
36963 is composite. Its prime factorisation is
- 3
The divisors add up to 56280; without 36963 itself that is 19317, so 36963 is deficient (19317 is less than 36963). Euler's totient φ(36963) = 23976 numbers up to 36963 share no factor with it.
- 4
The digits of 36963 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36963 = 3^{3} \times 37^{2} \]36963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 56280 |
| Euler totient φ(n) | 23976 |
| Square | 1366263369 |
| Cube | 50501192908347 |
| Square root | 192.257640 (= 111√3) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6963 × |
36963 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and sixty-three |
| Binary (base 2) | 1001000001100011 |
| Octal (base 8) | 110143 |
| Hexadecimal (base 16) | 9063 |
| Base 3 | 1212201000 |
| As time | 36963 seconds = 10 h 16 min 3 s |
Is 36963 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (36963 ÷ 3 = 12321) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (36963 ÷ 9 = 4107) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36963 a prime number?
No. 36963 = × , so it is divisible by 3.
What are the factors of 36963?
1, 3, 9, 27, 37, 111, 333, 999, 1369, 4107, 12321, 36963.
What is 36963 in binary?
1001000001100011 (hexadecimal 9063, octal 110143).
What is the square root of 36963?
About 192.2576, exactly 111√3.
Is 36963 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 36963?
36963 is a palindrome: it reads 36963 backwards too; a Harshad number: divisible by its digit sum 27.