The number 55152
55152 is a composite number with 30 divisors. Its prime factorisation is × × 383. Divisors (30): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 383 … 55152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55152: a Harshad number: divisible by its digit sum 18.
- 2
55152 is composite. Its prime factorisation is
- 3
The divisors add up to 154752; without 55152 itself that is 99600, so 55152 is abundant (99600 is more than 55152). Euler's totient φ(55152) = 18336 numbers up to 55152 share no factor with it.
- 4
The digits of 55152 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55152 = 2^{4} \times 3^{2} \times 383 \]55152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 154752 |
| Euler totient φ(n) | 18336 |
| Square | 3041743104 |
| Cube | 167758215671808 |
| Square root | 234.844629 (= 12√383) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5152 × |
55152 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand one hundred and fifty-two |
| Binary (base 2) | 1101011101110000 |
| Octal (base 8) | 153560 |
| Hexadecimal (base 16) | D770 |
| Base 3 | 2210122200 |
| As time | 55152 seconds = 15 h 19 min 12 s |
Is 55152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55152 ÷ 2 = 27576) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55152 ÷ 3 = 18384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (55152 ÷ 4 = 13788) | 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 | Yes (55152 ÷ 6 = 9192) | 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 | Yes (55152 ÷ 8 = 6894) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (55152 ÷ 9 = 6128) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (55152 ÷ 12 = 4596) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55152 a prime number?
No. 55152 = × × 383, so it is divisible by 2.
What are the factors of 55152?
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 383, 766, 1149, 1532, 2298, 3064, 3447, 4596, 6128, 6894, 9192, 13788, 18384, 27576, 55152.
What is 55152 in binary?
1101011101110000 (hexadecimal D770, octal 153560).
What is the square root of 55152?
About 234.8446, exactly 12√383.
Is 55152 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 55152?
55152 is a Harshad number: divisible by its digit sum 18.