The number 93268
93268 is a composite number with 12 divisors. Its prime factorisation is × 7 × 3331. Divisors (12): 1, 2, 4, 7, 14, 28, 3331, 6662, 13324, 23317, 46634, 93268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93268: a Harshad number: divisible by its digit sum 28.
- 2
93268 is composite. Its prime factorisation is
- 3
The divisors add up to 186592; without 93268 itself that is 93324, so 93268 is abundant (93324 is more than 93268). Euler's totient φ(93268) = 39960 numbers up to 93268 share no factor with it.
- 4
The digits of 93268 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93268 = 2^{2} \times 7 \times 3331 \]93268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 186592 |
| Euler totient φ(n) | 39960 |
| Square | 8698919824 |
| Cube | 811330854144832 |
| Square root | 305.398101 (= 2√23317) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 40 |
| Scientific notation | 9.3268 × |
93268 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and sixty-eight |
| Binary (base 2) | 10110110001010100 |
| Octal (base 8) | 266124 |
| Hexadecimal (base 16) | 16C54 |
| Base 3 | 11201221101 |
| As time | 93268 seconds = 25 h 54 min 28 s |
Is 93268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93268 ÷ 2 = 46634) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (93268 ÷ 4 = 23317) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (93268 ÷ 7 = 13324) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93268 a prime number?
No. 93268 = × 7 × 3331, so it is divisible by 2.
What are the factors of 93268?
1, 2, 4, 7, 14, 28, 3331, 6662, 13324, 23317, 46634, 93268.
What is 93268 in binary?
10110110001010100 (hexadecimal 16C54, octal 266124).
What is the square root of 93268?
About 305.3981, exactly 2√23317.
Is 93268 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 93268?
93268 is a Harshad number: divisible by its digit sum 28.