The number 55904
55904 is a composite number with 12 divisors. Its prime factorisation is × 1747. Divisors (12): 1, 2, 4, 8, 16, 32, 1747, 3494, 6988, 13976, 27952, 55904.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55904 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55904 is composite. Its prime factorisation is
- 3
The divisors add up to 110124; without 55904 itself that is 54220, so 55904 is deficient (54220 is less than 55904). Euler's totient φ(55904) = 27936 numbers up to 55904 share no factor with it.
- 4
The digits of 55904 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55904 = 2^{5} \times 1747 \]55904 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 110124 |
| Euler totient φ(n) | 27936 |
| Square | 3125257216 |
| Cube | 174714379403264 |
| Square root | 236.440267 (= 4√3494) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5904 × |
55904 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and four |
| Binary (base 2) | 1101101001100000 |
| Octal (base 8) | 155140 |
| Hexadecimal (base 16) | DA60 |
| Base 3 | 2211200112 |
| As time | 55904 seconds = 15 h 31 min 44 s |
Is 55904 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55904 ÷ 2 = 27952) | 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 | Yes (55904 ÷ 4 = 13976) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 | Yes (55904 ÷ 8 = 6988) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55904 a prime number?
No. 55904 = × 1747, so it is divisible by 2.
What are the factors of 55904?
1, 2, 4, 8, 16, 32, 1747, 3494, 6988, 13976, 27952, 55904.
What is 55904 in binary?
1101101001100000 (hexadecimal DA60, octal 155140).
What is the square root of 55904?
About 236.4403, exactly 4√3494.
Is 55904 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 55904?
It is a composite number with 12 divisors.