The number 55852
55852 is a composite number with 6 divisors. Its prime factorisation is × 13963. Divisors (6): 1, 2, 4, 13963, 27926, 55852.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55852 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55852 is composite. Its prime factorisation is
- 3
The divisors add up to 97748; without 55852 itself that is 41896, so 55852 is deficient (41896 is less than 55852). Euler's totient φ(55852) = 27924 numbers up to 55852 share no factor with it.
- 4
The digits of 55852 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55852 = 2^{2} \times 13963 \]55852 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 97748 |
| Euler totient φ(n) | 27924 |
| Square | 3119445904 |
| Cube | 174227292630208 |
| Square root | 236.330277 (= 2√13963) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5852 × |
55852 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand eight hundred and fifty-two |
| Binary (base 2) | 1101101000101100 |
| Octal (base 8) | 155054 |
| Hexadecimal (base 16) | DA2C |
| Base 3 | 2211121121 |
| As time | 55852 seconds = 15 h 30 min 52 s |
Is 55852 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55852 ÷ 2 = 27926) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (55852 ÷ 4 = 13963) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55852 a prime number?
No. 55852 = × 13963, so it is divisible by 2.
What are the factors of 55852?
1, 2, 4, 13963, 27926, 55852.
What is 55852 in binary?
1101101000101100 (hexadecimal DA2C, octal 155054).
What is the square root of 55852?
About 236.3303, exactly 2√13963.
Is 55852 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55852?
It is a composite number with 6 divisors.