The number 53152
53152 is a composite number with 24 divisors. Its prime factorisation is × 11 × 151. Divisors (24): 1, 2, 4, 8, 11, 16, 22, 32, 44, 88, 151, 176, 302, 352, 604, 1208 … 53152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53152: a Harshad number: divisible by its digit sum 16.
- 2
53152 is composite. Its prime factorisation is
- 3
The divisors add up to 114912; without 53152 itself that is 61760, so 53152 is abundant (61760 is more than 53152). Euler's totient φ(53152) = 24000 numbers up to 53152 share no factor with it.
- 4
The digits of 53152 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53152 = 2^{5} \times 11 \times 151 \]53152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 114912 |
| Euler totient φ(n) | 24000 |
| Square | 2825135104 |
| Cube | 150161581047808 |
| Square root | 230.547175 (= 4√3322) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.3152 × |
53152 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and fifty-two |
| Binary (base 2) | 1100111110100000 |
| Octal (base 8) | 147640 |
| Hexadecimal (base 16) | CFA0 |
| Base 3 | 2200220121 |
| As time | 53152 seconds = 14 h 45 min 52 s |
Is 53152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (53152 ÷ 2 = 26576) | 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 (53152 ÷ 4 = 13288) | 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 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 | Yes (53152 ÷ 8 = 6644) | 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 | Yes (53152 ÷ 11 = 4832) | 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 53152 a prime number?
No. 53152 = × 11 × 151, so it is divisible by 2.
What are the factors of 53152?
1, 2, 4, 8, 11, 16, 22, 32, 44, 88, 151, 176, 302, 352, 604, 1208, 1661, 2416, 3322, 4832, 6644, 13288, 26576, 53152.
What is 53152 in binary?
1100111110100000 (hexadecimal CFA0, octal 147640).
What is the square root of 53152?
About 230.5472, exactly 4√3322.
Is 53152 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53152?
53152 is a Harshad number: divisible by its digit sum 16.