The number 30936
30936 is a composite number with 16 divisors. Its prime factorisation is × 3 × 1289. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 1289, 2578, 3867, 5156, 7734, 10312, 15468, 30936.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30936 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30936 is composite. Its prime factorisation is
- 3
The divisors add up to 77400; without 30936 itself that is 46464, so 30936 is abundant (46464 is more than 30936). Euler's totient φ(30936) = 10304 numbers up to 30936 share no factor with it.
- 4
The digits of 30936 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 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30936 = 2^{3} \times 3 \times 1289 \]30936 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 77400 |
| Euler totient φ(n) | 10304 |
| Square | 957036096 |
| Cube | 29606868665856 |
| Square root | 175.886327 (= 2√7734) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 85 |
| Scientific notation | 3.0936 × |
30936 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and thirty-six |
| Binary (base 2) | 111100011011000 |
| Octal (base 8) | 74330 |
| Hexadecimal (base 16) | 78D8 |
| Base 3 | 1120102210 |
| As time | 30936 seconds = 8 h 35 min 36 s |
Is 30936 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30936 ÷ 2 = 15468) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (30936 ÷ 3 = 10312) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (30936 ÷ 4 = 7734) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (30936 ÷ 6 = 5156) | 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 | Yes (30936 ÷ 8 = 3867) | 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 6) | 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 | Yes (30936 ÷ 12 = 2578) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30936 a prime number?
No. 30936 = × 3 × 1289, so it is divisible by 2.
What are the factors of 30936?
1, 2, 3, 4, 6, 8, 12, 24, 1289, 2578, 3867, 5156, 7734, 10312, 15468, 30936.
What is 30936 in binary?
111100011011000 (hexadecimal 78D8, octal 74330).
What is the square root of 30936?
About 175.8863, exactly 2√7734.
Is 30936 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 30936?
It is a composite number with 16 divisors.