The number 96423
96423 is a composite number with 4 divisors. Its prime factorisation is 3 × 32141. Divisors (4): 1, 3, 32141, 96423.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96423: a semiprime: 3 × 32141, the product of two primes.
- 2
96423 is composite. Its prime factorisation is
- 3
The divisors add up to 128568; without 96423 itself that is 32145, so 96423 is deficient (32145 is less than 96423). Euler's totient φ(96423) = 64280 numbers up to 96423 share no factor with it.
- 4
The digits of 96423 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96423 = 3 \times 32141 \]
96423 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 128568 |
| Euler totient φ(n) | 64280 |
| Square | 9297394929 |
| Cube | 896482711238967 |
| Square root | 310.520531 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.6423 × |
96423 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and twenty-three |
| Binary (base 2) | 10111100010100111 |
| Octal (base 8) | 274247 |
| Hexadecimal (base 16) | 178A7 |
| Base 3 | 11220021020 |
| As time | 96423 seconds = 26 h 47 min 3 s |
Is 96423 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 (96423 ÷ 3 = 32141) | 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 3) | 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 5) | 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 7) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96423 a prime number?
No. 96423 = 3 × 32141, so it is divisible by 3.
What are the factors of 96423?
1, 3, 32141, 96423.
What is 96423 in binary?
10111100010100111 (hexadecimal 178A7, octal 274247).
What is the square root of 96423?
About 310.5205.
Is 96423 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 96423?
96423 is a semiprime: 3 × 32141, the product of two primes.