The number 55913
55913 is a composite number with 16 divisors. Its prime factorisation is 11 × 13 × 17 × 23. Divisors (16): 1, 11, 13, 17, 23, 143, 187, 221, 253, 299, 391, 2431, 3289, 4301, 5083, 55913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55913: a Harshad number: divisible by its digit sum 23.
- 2
55913 is composite. Its prime factorisation is
- 3
The divisors add up to 72576; without 55913 itself that is 16663, so 55913 is deficient (16663 is less than 55913). Euler's totient φ(55913) = 42240 numbers up to 55913 share no factor with it.
- 4
The digits of 55913 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 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55913 = 11 \times 13 \times 17 \times 23 \]
55913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 72576 |
| Euler totient φ(n) | 42240 |
| Square | 3126263569 |
| Cube | 174798774933497 |
| Square root | 236.459299 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.5913 × |
55913 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirteen |
| Binary (base 2) | 1101101001101001 |
| Octal (base 8) | 155151 |
| Hexadecimal (base 16) | DA69 |
| Base 3 | 2211200212 |
| As time | 55913 seconds = 15 h 31 min 53 s |
Is 55913 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55913 ÷ 11 = 5083) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55913 a prime number?
No. 55913 = 11 × 13 × 17 × 23, so it is divisible by 11.
What are the factors of 55913?
1, 11, 13, 17, 23, 143, 187, 221, 253, 299, 391, 2431, 3289, 4301, 5083, 55913.
What is 55913 in binary?
1101101001101001 (hexadecimal DA69, octal 155151).
What is the square root of 55913?
About 236.4593.
Is 55913 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55913?
55913 is a Harshad number: divisible by its digit sum 23.