The number 13406
13406 is a composite number with 4 divisors. Its prime factorisation is 2 × 6703. Divisors (4): 1, 2, 6703, 13406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13406: a semiprime: 2 × 6703, the product of two primes.
- 2
13406 is composite. Its prime factorisation is
- 3
The divisors add up to 20112; without 13406 itself that is 6706, so 13406 is deficient (6706 is less than 13406). Euler's totient φ(13406) = 6702 numbers up to 13406 share no factor with it.
- 4
The digits of 13406 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13406 = 2 \times 6703 \]
13406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20112 |
| Euler totient φ(n) | 6702 |
| Square | 179720836 |
| Cube | 2409337527416 |
| Square root | 115.784282 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 94 |
| Scientific notation | 1.3406 × |
13406 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand four hundred and six |
| Binary (base 2) | 11010001011110 |
| Octal (base 8) | 32136 |
| Hexadecimal (base 16) | 345E |
| Base 3 | 200101112 |
| As time | 13406 seconds = 3 h 43 min 26 s |
Is 13406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (13406 ÷ 2 = 6703) | 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 1) | 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 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 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 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13406 a prime number?
No. 13406 = 2 × 6703, so it is divisible by 2.
What are the factors of 13406?
1, 2, 6703, 13406.
What is 13406 in binary?
11010001011110 (hexadecimal 345E, octal 32136).
What is the square root of 13406?
About 115.7843.
Is 13406 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 13406?
13406 is a semiprime: 2 × 6703, the product of two primes.