The number 93036
93036 is a composite number with 12 divisors. Its prime factorisation is × 3 × 7753. Divisors (12): 1, 2, 3, 4, 6, 12, 7753, 15506, 23259, 31012, 46518, 93036.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93036 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93036 is composite. Its prime factorisation is
- 3
The divisors add up to 217112; without 93036 itself that is 124076, so 93036 is abundant (124076 is more than 93036). Euler's totient φ(93036) = 31008 numbers up to 93036 share no factor with it.
- 4
The digits of 93036 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 159 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93036 = 2^{2} \times 3 \times 7753 \]93036 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 217112 |
| Euler totient φ(n) | 31008 |
| Square | 8655697296 |
| Cube | 805291453630656 |
| Square root | 305.018032 (= 2√23259) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 159 |
| Scientific notation | 9.3036 × |
93036 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand and thirty-six |
| Binary (base 2) | 10110101101101100 |
| Octal (base 8) | 265554 |
| Hexadecimal (base 16) | 16B6C |
| Base 3 | 11201121210 |
| As time | 93036 seconds = 25 h 50 min 36 s |
Is 93036 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93036 ÷ 2 = 46518) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (93036 ÷ 3 = 31012) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (93036 ÷ 4 = 23259) | 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 (93036 ÷ 6 = 15506) | 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 | No (remainder 4) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (93036 ÷ 12 = 7753) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93036 a prime number?
No. 93036 = × 3 × 7753, so it is divisible by 2.
What are the factors of 93036?
1, 2, 3, 4, 6, 12, 7753, 15506, 23259, 31012, 46518, 93036.
What is 93036 in binary?
10110101101101100 (hexadecimal 16B6C, octal 265554).
What is the square root of 93036?
About 305.0180, exactly 2√23259.
Is 93036 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 93036?
It is a composite number with 12 divisors.