The number 11406
11406 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1901. Divisors (8): 1, 2, 3, 6, 1901, 3802, 5703, 11406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11406 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11406 is composite. Its prime factorisation is
- 3
The divisors add up to 22824; without 11406 itself that is 11418, so 11406 is abundant (11418 is more than 11406). Euler's totient φ(11406) = 3800 numbers up to 11406 share no factor with it.
- 4
The digits of 11406 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11406 = 2 \times 3 \times 1901 \]
11406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22824 |
| Euler totient φ(n) | 3800 |
| Square | 130096836 |
| Cube | 1483884511416 |
| Square root | 106.798876 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.1406 × |
11406 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and six |
| Binary (base 2) | 10110010001110 |
| Octal (base 8) | 26216 |
| Hexadecimal (base 16) | 2C8E |
| Base 3 | 120122110 |
| As time | 11406 seconds = 3 h 10 min 6 s |
Is 11406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11406 ÷ 2 = 5703) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11406 ÷ 3 = 3802) | 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 | Yes (11406 ÷ 6 = 1901) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11406 a prime number?
No. 11406 = 2 × 3 × 1901, so it is divisible by 2.
What are the factors of 11406?
1, 2, 3, 6, 1901, 3802, 5703, 11406.
What is 11406 in binary?
10110010001110 (hexadecimal 2C8E, octal 26216).
What is the square root of 11406?
About 106.7989.
Is 11406 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11406?
It is a composite number with 8 divisors.