The number 93496
93496 is a composite number with 32 divisors. Its prime factorisation is × 13 × 29 × 31. Divisors (32): 1, 2, 4, 8, 13, 26, 29, 31, 52, 58, 62, 104, 116, 124, 232, 248 … 93496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93496: a Harshad number: divisible by its digit sum 31.
- 2
93496 is composite. Its prime factorisation is
- 3
The divisors add up to 201600; without 93496 itself that is 108104, so 93496 is abundant (108104 is more than 93496). Euler's totient φ(93496) = 40320 numbers up to 93496 share no factor with it.
- 4
The digits of 93496 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93496 = 2^{3} \times 13 \times 29 \times 31 \]93496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 201600 |
| Euler totient φ(n) | 40320 |
| Square | 8741502016 |
| Cube | 817295472487936 |
| Square root | 305.771156 (= 2√23374) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 71 |
| Scientific notation | 9.3496 × |
93496 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand four hundred and ninety-six |
| Binary (base 2) | 10110110100111000 |
| Octal (base 8) | 266470 |
| Hexadecimal (base 16) | 16D38 |
| Base 3 | 11202020211 |
| As time | 93496 seconds = 25 h 58 min 16 s |
Is 93496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93496 ÷ 2 = 46748) | 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 (93496 ÷ 4 = 23374) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (93496 ÷ 8 = 11687) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 7) | 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 93496 a prime number?
No. 93496 = × 13 × 29 × 31, so it is divisible by 2.
What are the factors of 93496?
1, 2, 4, 8, 13, 26, 29, 31, 52, 58, 62, 104, 116, 124, 232, 248, 377, 403, 754, 806, 899, 1508, 1612, 1798, 3016, 3224, 3596, 7192, 11687, 23374, 46748, 93496.
What is 93496 in binary?
10110110100111000 (hexadecimal 16D38, octal 266470).
What is the square root of 93496?
About 305.7712, exactly 2√23374.
Is 93496 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 93496?
93496 is a Harshad number: divisible by its digit sum 31.