The number 96432
96432 is a composite number with 60 divisors. Its prime factorisation is × 3 × × 41. Divisors (60): 1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 41, 42, 48 … 96432.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96432: a Harshad number: divisible by its digit sum 24.
- 2
96432 is composite. Its prime factorisation is
- 3
The divisors add up to 296856; without 96432 itself that is 200424, so 96432 is abundant (200424 is more than 96432). Euler's totient φ(96432) = 26880 numbers up to 96432 share no factor with it.
- 4
The digits of 96432 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96432 = 2^{4} \times 3 \times 7^{2} \times 41 \]96432 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 60 |
| Sum of divisors | 296856 |
| Euler totient φ(n) | 26880 |
| Square | 9299130624 |
| Cube | 896733764333568 |
| Square root | 310.535022 (= 28√123) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.6432 × |
96432 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and thirty-two |
| Binary (base 2) | 10111100010110000 |
| Octal (base 8) | 274260 |
| Hexadecimal (base 16) | 178B0 |
| Base 3 | 11220021120 |
| As time | 96432 seconds = 26 h 47 min 12 s |
Is 96432 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (96432 ÷ 2 = 48216) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (96432 ÷ 3 = 32144) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (96432 ÷ 4 = 24108) | 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 | Yes (96432 ÷ 6 = 16072) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (96432 ÷ 7 = 13776) | 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 (96432 ÷ 8 = 12054) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 | Yes (96432 ÷ 12 = 8036) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96432 a prime number?
No. 96432 = × 3 × × 41, so it is divisible by 2.
What are the factors of 96432?
1, 2, 3, 4, 6, 7, 8, 12, 14, 16, 21, 24, 28, 41, 42, 48, 49, 56, 82, 84, 98, 112, 123, 147, 164, 168, 196, 246, 287, 294, 328, 336, 392, 492, 574, 588, 656, 784, 861, 984, 1148, 1176, 1722, 1968, 2009, 2296, 2352, 3444, 4018, 4592, 6027, 6888, 8036, 12054, 13776, 16072, 24108, 32144, 48216, 96432.
What is 96432 in binary?
10111100010110000 (hexadecimal 178B0, octal 274260).
What is the square root of 96432?
About 310.5350, exactly 28√123.
Is 96432 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 96432?
96432 is a Harshad number: divisible by its digit sum 24.