The number 55905
55905 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3727. Divisors (8): 1, 3, 5, 15, 3727, 11181, 18635, 55905.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55905 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55905 is composite. Its prime factorisation is
- 3
The divisors add up to 89472; without 55905 itself that is 33567, so 55905 is deficient (33567 is less than 55905). Euler's totient φ(55905) = 29808 numbers up to 55905 share no factor with it.
- 4
The digits of 55905 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55905 = 3 \times 5 \times 3727 \]
55905 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 89472 |
| Euler totient φ(n) | 29808 |
| Square | 3125369025 |
| Cube | 174723755342625 |
| Square root | 236.442382 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5905 × |
55905 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and five |
| Binary (base 2) | 1101101001100001 |
| Octal (base 8) | 155141 |
| Hexadecimal (base 16) | DA61 |
| Base 3 | 2211200120 |
| As time | 55905 seconds = 15 h 31 min 45 s |
Is 55905 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 (55905 ÷ 3 = 18635) | 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 | Yes (55905 ÷ 5 = 11181) | 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 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 | No (remainder 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55905 a prime number?
No. 55905 = 3 × 5 × 3727, so it is divisible by 3.
What are the factors of 55905?
1, 3, 5, 15, 3727, 11181, 18635, 55905.
What is 55905 in binary?
1101101001100001 (hexadecimal DA61, octal 155141).
What is the square root of 55905?
About 236.4424.
Is 55905 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 55905?
It is a composite number with 8 divisors.