The number 96412
96412 is a composite number with 6 divisors. Its prime factorisation is × 24103. Divisors (6): 1, 2, 4, 24103, 48206, 96412.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96412 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96412 is composite. Its prime factorisation is
- 3
The divisors add up to 168728; without 96412 itself that is 72316, so 96412 is deficient (72316 is less than 96412). Euler's totient φ(96412) = 48204 numbers up to 96412 share no factor with it.
- 4
The digits of 96412 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96412 = 2^{2} \times 24103 \]96412 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 168728 |
| Euler totient φ(n) | 48204 |
| Square | 9295273744 |
| Cube | 896175932206528 |
| Square root | 310.502818 (= 2√24103) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 45 |
| Scientific notation | 9.6412 × |
96412 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and twelve |
| Binary (base 2) | 10111100010011100 |
| Octal (base 8) | 274234 |
| Hexadecimal (base 16) | 1789C |
| Base 3 | 11220020211 |
| As time | 96412 seconds = 26 h 46 min 52 s |
Is 96412 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (96412 ÷ 2 = 48206) | 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 (96412 ÷ 4 = 24103) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | 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 8) | 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 96412 a prime number?
No. 96412 = × 24103, so it is divisible by 2.
What are the factors of 96412?
1, 2, 4, 24103, 48206, 96412.
What is 96412 in binary?
10111100010011100 (hexadecimal 1789C, octal 274234).
What is the square root of 96412?
About 310.5028, exactly 2√24103.
Is 96412 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 96412?
It is a composite number with 6 divisors.