The number 93267
93267 is a composite number with 12 divisors. Its prime factorisation is × 43 × 241. Divisors (12): 1, 3, 9, 43, 129, 241, 387, 723, 2169, 10363, 31089, 93267.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93267 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93267 is composite. Its prime factorisation is
- 3
The divisors add up to 138424; without 93267 itself that is 45157, so 93267 is deficient (45157 is less than 93267). Euler's totient φ(93267) = 60480 numbers up to 93267 share no factor with it.
- 4
The digits of 93267 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93267 = 3^{2} \times 43 \times 241 \]93267 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 138424 |
| Euler totient φ(n) | 60480 |
| Square | 8698733289 |
| Cube | 811304757665163 |
| Square root | 305.396464 (= 3√10363) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.3267 × |
93267 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and sixty-seven |
| Binary (base 2) | 10110110001010011 |
| Octal (base 8) | 266123 |
| Hexadecimal (base 16) | 16C53 |
| Base 3 | 11201221100 |
| As time | 93267 seconds = 25 h 54 min 27 s |
Is 93267 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 (93267 ÷ 3 = 31089) | 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 2) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93267 ÷ 9 = 10363) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93267 a prime number?
No. 93267 = × 43 × 241, so it is divisible by 3.
What are the factors of 93267?
1, 3, 9, 43, 129, 241, 387, 723, 2169, 10363, 31089, 93267.
What is 93267 in binary?
10110110001010011 (hexadecimal 16C53, octal 266123).
What is the square root of 93267?
About 305.3965, exactly 3√10363.
Is 93267 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93267?
It is a composite number with 12 divisors.