The number 55391
55391 is a composite number with 8 divisors. Its prime factorisation is 7 × 41 × 193. Divisors (8): 1, 7, 41, 193, 287, 1351, 7913, 55391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55391 is composite. Its prime factorisation is
- 3
The divisors add up to 65184; without 55391 itself that is 9793, so 55391 is deficient (9793 is less than 55391). Euler's totient φ(55391) = 46080 numbers up to 55391 share no factor with it.
- 4
The digits of 55391 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55391 = 7 \times 41 \times 193 \]
55391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65184 |
| Euler totient φ(n) | 46080 |
| Square | 3068162881 |
| Cube | 169948610141471 |
| Square root | 235.352926 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5391 × |
55391 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand three hundred and ninety-one |
| Binary (base 2) | 1101100001011111 |
| Octal (base 8) | 154137 |
| Hexadecimal (base 16) | D85F |
| Base 3 | 2210222112 |
| As time | 55391 seconds = 15 h 23 min 11 s |
Is 55391 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (55391 ÷ 7 = 7913) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55391 a prime number?
No. 55391 = 7 × 41 × 193, so it is divisible by 7.
What are the factors of 55391?
1, 7, 41, 193, 287, 1351, 7913, 55391.
What is 55391 in binary?
1101100001011111 (hexadecimal D85F, octal 154137).
What is the square root of 55391?
About 235.3529.
Is 55391 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55391?
It is a composite number with 8 divisors.