The number 55833
55833 is a composite number with 8 divisors. Its prime factorisation is 3 × 37 × 503. Divisors (8): 1, 3, 37, 111, 503, 1509, 18611, 55833.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55833 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55833 is composite. Its prime factorisation is
- 3
The divisors add up to 76608; without 55833 itself that is 20775, so 55833 is deficient (20775 is less than 55833). Euler's totient φ(55833) = 36144 numbers up to 55833 share no factor with it.
- 4
The digits of 55833 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
\[ 55833 = 3 \times 37 \times 503 \]
55833 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76608 |
| Euler totient φ(n) | 36144 |
| Square | 3117323889 |
| Cube | 174049544694537 |
| Square root | 236.290076 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5833 × |
55833 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand eight hundred and thirty-three |
| Binary (base 2) | 1101101000011001 |
| Octal (base 8) | 155031 |
| Hexadecimal (base 16) | DA19 |
| Base 3 | 2211120220 |
| As time | 55833 seconds = 15 h 30 min 33 s |
Is 55833 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 (55833 ÷ 3 = 18611) | 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 | No (remainder 3) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 55833 a prime number?
No. 55833 = 3 × 37 × 503, so it is divisible by 3.
What are the factors of 55833?
1, 3, 37, 111, 503, 1509, 18611, 55833.
What is 55833 in binary?
1101101000011001 (hexadecimal DA19, octal 155031).
What is the square root of 55833?
About 236.2901.
Is 55833 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 55833?
It is a composite number with 8 divisors.