The number 96422
96422 is a composite number with 8 divisors. Its prime factorisation is 2 × 37 × 1303. Divisors (8): 1, 2, 37, 74, 1303, 2606, 48211, 96422.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
96422 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
96422 is composite. Its prime factorisation is
- 3
The divisors add up to 148656; without 96422 itself that is 52234, so 96422 is deficient (52234 is less than 96422). Euler's totient φ(96422) = 46872 numbers up to 96422 share no factor with it.
- 4
The digits of 96422 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96422 = 2 \times 37 \times 1303 \]
96422 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 148656 |
| Euler totient φ(n) | 46872 |
| Square | 9297202084 |
| Cube | 896454819343448 |
| Square root | 310.518921 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.6422 × |
96422 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand four hundred and twenty-two |
| Binary (base 2) | 10111100010100110 |
| Octal (base 8) | 274246 |
| Hexadecimal (base 16) | 178A6 |
| Base 3 | 11220021012 |
| As time | 96422 seconds = 26 h 47 min 2 s |
Is 96422 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (96422 ÷ 2 = 48211) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96422 a prime number?
No. 96422 = 2 × 37 × 1303, so it is divisible by 2.
What are the factors of 96422?
1, 2, 37, 74, 1303, 2606, 48211, 96422.
What is 96422 in binary?
10111100010100110 (hexadecimal 178A6, octal 274246).
What is the square root of 96422?
About 310.5189.
Is 96422 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 96422?
It is a composite number with 8 divisors.