The number 36933
36933 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 947. Divisors (8): 1, 3, 13, 39, 947, 2841, 12311, 36933.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
36933 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
36933 is composite. Its prime factorisation is
- 3
The divisors add up to 53088; without 36933 itself that is 16155, so 36933 is deficient (16155 is less than 36933). Euler's totient φ(36933) = 22704 numbers up to 36933 share no factor with it.
- 4
The digits of 36933 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 36933 = 3 \times 13 \times 947 \]
36933 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 53088 |
| Euler totient φ(n) | 22704 |
| Square | 1364046489 |
| Cube | 50378328978237 |
| Square root | 192.179603 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.6933 × |
36933 in other forms
| Form | Value |
|---|---|
| In words | thirty-six thousand nine hundred and thirty-three |
| Binary (base 2) | 1001000001000101 |
| Octal (base 8) | 110105 |
| Hexadecimal (base 16) | 9045 |
| Base 3 | 1212122220 |
| As time | 36933 seconds = 10 h 15 min 33 s |
Is 36933 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 (36933 ÷ 3 = 12311) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 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 | No (remainder 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 36933 a prime number?
No. 36933 = 3 × 13 × 947, so it is divisible by 3.
What are the factors of 36933?
1, 3, 13, 39, 947, 2841, 12311, 36933.
What is 36933 in binary?
1001000001000101 (hexadecimal 9045, octal 110105).
What is the square root of 36933?
About 192.1796.
Is 36933 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 36933?
It is a composite number with 8 divisors.