The number 55052
55052 is a composite number with 6 divisors. Its prime factorisation is × 13763. Divisors (6): 1, 2, 4, 13763, 27526, 55052.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55052: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55052 is composite. Its prime factorisation is
- 3
The divisors add up to 96348; without 55052 itself that is 41296, so 55052 is deficient (41296 is less than 55052). Euler's totient φ(55052) = 27524 numbers up to 55052 share no factor with it.
- 4
The digits of 55052 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55052 = 2^{2} \times 13763 \]55052 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 96348 |
| Euler totient φ(n) | 27524 |
| Square | 3030722704 |
| Cube | 166847346300608 |
| Square root | 234.631626 (= 2√13763) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5052 × |
55052 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and fifty-two |
| Binary (base 2) | 1101011100001100 |
| Octal (base 8) | 153414 |
| Hexadecimal (base 16) | D70C |
| Base 3 | 2210111222 |
| As time | 55052 seconds = 15 h 17 min 32 s |
Is 55052 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55052 ÷ 2 = 27526) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (55052 ÷ 4 = 13763) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55052 a prime number?
No. 55052 = × 13763, so it is divisible by 2.
What are the factors of 55052?
1, 2, 4, 13763, 27526, 55052.
What is 55052 in binary?
1101011100001100 (hexadecimal D70C, octal 153414).
What is the square root of 55052?
About 234.6316, exactly 2√13763.
Is 55052 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 55052?
55052 is a happy number: repeatedly adding the squares of its digits reaches 1.