The number 55851
55851 is a composite number with 4 divisors. Its prime factorisation is 3 × 18617. Divisors (4): 1, 3, 18617, 55851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55851: a semiprime: 3 × 18617, the product of two primes.
- 2
55851 is composite. Its prime factorisation is
- 3
The divisors add up to 74472; without 55851 itself that is 18621, so 55851 is deficient (18621 is less than 55851). Euler's totient φ(55851) = 37232 numbers up to 55851 share no factor with it.
- 4
The digits of 55851 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
\[ 55851 = 3 \times 18617 \]
55851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74472 |
| Euler totient φ(n) | 37232 |
| Square | 3119334201 |
| Cube | 174217934460051 |
| Square root | 236.328162 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5851 × |
55851 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand eight hundred and fifty-one |
| Binary (base 2) | 1101101000101011 |
| Octal (base 8) | 155053 |
| Hexadecimal (base 16) | DA2B |
| Base 3 | 2211121120 |
| As time | 55851 seconds = 15 h 30 min 51 s |
Is 55851 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 (55851 ÷ 3 = 18617) | 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 | No (remainder 1) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 55851 a prime number?
No. 55851 = 3 × 18617, so it is divisible by 3.
What are the factors of 55851?
1, 3, 18617, 55851.
What is 55851 in binary?
1101101000101011 (hexadecimal DA2B, octal 155053).
What is the square root of 55851?
About 236.3282.
Is 55851 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 55851?
55851 is a semiprime: 3 × 18617, the product of two primes.