The number 55912
55912 is a composite number with 16 divisors. Its prime factorisation is × 29 × 241. Divisors (16): 1, 2, 4, 8, 29, 58, 116, 232, 241, 482, 964, 1928, 6989, 13978, 27956, 55912.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55912 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55912 is composite. Its prime factorisation is
- 3
The divisors add up to 108900; without 55912 itself that is 52988, so 55912 is deficient (52988 is less than 55912). Euler's totient φ(55912) = 26880 numbers up to 55912 share no factor with it.
- 4
The digits of 55912 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55912 = 2^{3} \times 29 \times 241 \]55912 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108900 |
| Euler totient φ(n) | 26880 |
| Square | 3126151744 |
| Cube | 174789396310528 |
| Square root | 236.457184 (= 2√13978) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5912 × |
55912 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and twelve |
| Binary (base 2) | 1101101001101000 |
| Octal (base 8) | 155150 |
| Hexadecimal (base 16) | DA68 |
| Base 3 | 2211200211 |
| As time | 55912 seconds = 15 h 31 min 52 s |
Is 55912 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55912 ÷ 2 = 27956) | 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 | Yes (55912 ÷ 4 = 13978) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | 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 | Yes (55912 ÷ 8 = 6989) | 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 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55912 a prime number?
No. 55912 = × 29 × 241, so it is divisible by 2.
What are the factors of 55912?
1, 2, 4, 8, 29, 58, 116, 232, 241, 482, 964, 1928, 6989, 13978, 27956, 55912.
What is 55912 in binary?
1101101001101000 (hexadecimal DA68, octal 155150).
What is the square root of 55912?
About 236.4572, exactly 2√13978.
Is 55912 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 55912?
It is a composite number with 16 divisors.