The number 55406
55406 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 2131. Divisors (8): 1, 2, 13, 26, 2131, 4262, 27703, 55406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55406 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55406 is composite. Its prime factorisation is
- 3
The divisors add up to 89544; without 55406 itself that is 34138, so 55406 is deficient (34138 is less than 55406). Euler's totient φ(55406) = 25560 numbers up to 55406 share no factor with it.
- 4
The digits of 55406 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55406 = 2 \times 13 \times 2131 \]
55406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 89544 |
| Euler totient φ(n) | 25560 |
| Square | 3069824836 |
| Cube | 170086714863416 |
| Square root | 235.384791 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.5406 × |
55406 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and six |
| Binary (base 2) | 1101100001101110 |
| Octal (base 8) | 154156 |
| Hexadecimal (base 16) | D86E |
| Base 3 | 2211000002 |
| As time | 55406 seconds = 15 h 23 min 26 s |
Is 55406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55406 ÷ 2 = 27703) | 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 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55406 a prime number?
No. 55406 = 2 × 13 × 2131, so it is divisible by 2.
What are the factors of 55406?
1, 2, 13, 26, 2131, 4262, 27703, 55406.
What is 55406 in binary?
1101100001101110 (hexadecimal D86E, octal 154156).
What is the square root of 55406?
About 235.3848.
Is 55406 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55406?
It is a composite number with 8 divisors.