The number 55911
55911 is a composite number with 4 divisors. Its prime factorisation is 3 × 18637. Divisors (4): 1, 3, 18637, 55911.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55911: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 18637, the product of two primes.
- 2
55911 is composite. Its prime factorisation is
- 3
The divisors add up to 74552; without 55911 itself that is 18641, so 55911 is deficient (18641 is less than 55911). Euler's totient φ(55911) = 37272 numbers up to 55911 share no factor with it.
- 4
The digits of 55911 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55911 = 3 \times 18637 \]
55911 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74552 |
| Euler totient φ(n) | 37272 |
| Square | 3126039921 |
| Cube | 174780018023031 |
| Square root | 236.455070 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5911 × |
55911 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and eleven |
| Binary (base 2) | 1101101001100111 |
| Octal (base 8) | 155147 |
| Hexadecimal (base 16) | DA67 |
| Base 3 | 2211200210 |
| As time | 55911 seconds = 15 h 31 min 51 s |
Is 55911 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 | Yes (55911 ÷ 3 = 18637) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55911 a prime number?
No. 55911 = 3 × 18637, so it is divisible by 3.
What are the factors of 55911?
1, 3, 18637, 55911.
What is 55911 in binary?
1101101001100111 (hexadecimal DA67, octal 155147).
What is the square root of 55911?
About 236.4551.
Is 55911 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55911?
55911 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 18637, the product of two primes.