The number 3406
3406 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 131. Divisors (8): 1, 2, 13, 26, 131, 262, 1703, 3406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3406: a Harshad number: divisible by its digit sum 13.
- 2
3406 is composite. Its prime factorisation is
- 3
The divisors add up to 5544; without 3406 itself that is 2138, so 3406 is deficient (2138 is less than 3406). Euler's totient φ(3406) = 1560 numbers up to 3406 share no factor with it.
- 4
The digits of 3406 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 61 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3406 = 2 \times 13 \times 131 \]
3406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 5544 |
| Euler totient φ(n) | 1560 |
| Square | 11600836 |
| Cube | 39512447416 |
| Square root | 58.360946 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 61 |
| Scientific notation | 3.406 × |
3406 in other forms
| Form | Value |
|---|---|
| In words | three thousand four hundred and six |
| Roman numerals | MMMCDVI |
| Binary (base 2) | 110101001110 |
| Octal (base 8) | 6516 |
| Hexadecimal (base 16) | D4E |
| Base 3 | 11200011 |
| As time | 3406 seconds = 56 min 46 s |
Is 3406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3406 ÷ 2 = 1703) | 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 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 4) | 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 7) | 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 3406 a prime number?
No. 3406 = 2 × 13 × 131, so it is divisible by 2.
What are the factors of 3406?
1, 2, 13, 26, 131, 262, 1703, 3406.
What is 3406 in binary?
110101001110 (hexadecimal D4E, octal 6516).
What is the square root of 3406?
About 58.3609.
What is 3406 in Roman numerals?
MMMCDVI.
Is 3406 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 3406?
3406 is a Harshad number: divisible by its digit sum 13.