The number 93231
93231 is a composite number with 10 divisors. Its prime factorisation is × 1151. Divisors (10): 1, 3, 9, 27, 81, 1151, 3453, 10359, 31077, 93231.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93231 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93231 is composite. Its prime factorisation is
- 3
The divisors add up to 139392; without 93231 itself that is 46161, so 93231 is deficient (46161 is less than 93231). Euler's totient φ(93231) = 62100 numbers up to 93231 share no factor with it.
- 4
The digits of 93231 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93231 = 3^{4} \times 1151 \]93231 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 139392 |
| Euler totient φ(n) | 62100 |
| Square | 8692019361 |
| Cube | 810365657045391 |
| Square root | 305.337518 (= 9√1151) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 58 |
| Scientific notation | 9.3231 × |
93231 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and thirty-one |
| Binary (base 2) | 10110110000101111 |
| Octal (base 8) | 266057 |
| Hexadecimal (base 16) | 16C2F |
| Base 3 | 11201220000 |
| As time | 93231 seconds = 25 h 53 min 51 s |
Is 93231 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 (93231 ÷ 3 = 31077) | 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 1) | 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 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93231 ÷ 9 = 10359) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93231 a prime number?
No. 93231 = × 1151, so it is divisible by 3.
What are the factors of 93231?
1, 3, 9, 27, 81, 1151, 3453, 10359, 31077, 93231.
What is 93231 in binary?
10110110000101111 (hexadecimal 16C2F, octal 266057).
What is the square root of 93231?
About 305.3375, exactly 9√1151.
Is 93231 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 93231?
It is a composite number with 10 divisors.