The number 9406
9406 is a composite number with 4 divisors. Its prime factorisation is 2 × 4703. Divisors (4): 1, 2, 4703, 9406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9406: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 4703, the product of two primes.
- 2
9406 is composite. Its prime factorisation is
- 3
The divisors add up to 14112; without 9406 itself that is 4706, so 9406 is deficient (4706 is less than 9406). Euler's totient φ(9406) = 4702 numbers up to 9406 share no factor with it.
- 4
The digits of 9406 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9406 = 2 \times 4703 \]
9406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14112 |
| Euler totient φ(n) | 4702 |
| Square | 88472836 |
| Cube | 832175495416 |
| Square root | 96.984535 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.406 × |
9406 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and six |
| Binary (base 2) | 10010010111110 |
| Octal (base 8) | 22276 |
| Hexadecimal (base 16) | 24BE |
| Base 3 | 110220101 |
| As time | 9406 seconds = 2 h 36 min 46 s |
Is 9406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9406 ÷ 2 = 4703) | 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 | No (remainder 2) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9406 a prime number?
No. 9406 = 2 × 4703, so it is divisible by 2.
What are the factors of 9406?
1, 2, 4703, 9406.
What is 9406 in binary?
10010010111110 (hexadecimal 24BE, octal 22276).
What is the square root of 9406?
About 96.9845.
Is 9406 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 9406?
9406 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 4703, the product of two primes.