The number 55935
55935 is a composite number with 24 divisors. Its prime factorisation is × 5 × 11 × 113. Divisors (24): 1, 3, 5, 9, 11, 15, 33, 45, 55, 99, 113, 165, 339, 495, 565, 1017 … 55935.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55935 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55935 is composite. Its prime factorisation is
- 3
The divisors add up to 106704; without 55935 itself that is 50769, so 55935 is deficient (50769 is less than 55935). Euler's totient φ(55935) = 26880 numbers up to 55935 share no factor with it.
- 4
The digits of 55935 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55935 = 3^{2} \times 5 \times 11 \times 113 \]55935 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 106704 |
| Euler totient φ(n) | 26880 |
| Square | 3128724225 |
| Cube | 175005189525375 |
| Square root | 236.505814 (= 3√6215) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.5935 × |
55935 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and thirty-five |
| Binary (base 2) | 1101101001111111 |
| Octal (base 8) | 155177 |
| Hexadecimal (base 16) | DA7F |
| Base 3 | 2211201200 |
| As time | 55935 seconds = 15 h 32 min 15 s |
Is 55935 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 (55935 ÷ 3 = 18645) | 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 | Yes (55935 ÷ 5 = 11187) | 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 5) | 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 | Yes (55935 ÷ 9 = 6215) | 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 | Yes (55935 ÷ 11 = 5085) | 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 55935 a prime number?
No. 55935 = × 5 × 11 × 113, so it is divisible by 3.
What are the factors of 55935?
1, 3, 5, 9, 11, 15, 33, 45, 55, 99, 113, 165, 339, 495, 565, 1017, 1243, 1695, 3729, 5085, 6215, 11187, 18645, 55935.
What is 55935 in binary?
1101101001111111 (hexadecimal DA7F, octal 155177).
What is the square root of 55935?
About 236.5058, exactly 3√6215.
Is 55935 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 55935?
It is a composite number with 24 divisors.