The number 58032
58032 is a composite number with 60 divisors. Its prime factorisation is × × 13 × 31. Divisors (60): 1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18, 24, 26, 31, 36, 39 … 58032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58032: a Harshad number: divisible by its digit sum 18.
- 2
58032 is composite. Its prime factorisation is
- 3
The divisors add up to 180544; without 58032 itself that is 122512, so 58032 is abundant (122512 is more than 58032). Euler's totient φ(58032) = 17280 numbers up to 58032 share no factor with it.
- 4
The digits of 58032 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
\[ 58032 = 2^{4} \times 3^{2} \times 13 \times 31 \]58032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 60 |
| Sum of divisors | 180544 |
| Euler totient φ(n) | 17280 |
| Square | 3367713024 |
| Cube | 195435122208768 |
| Square root | 240.898319 (= 12√403) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.8032 × |
58032 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and thirty-two |
| Binary (base 2) | 1110001010110000 |
| Octal (base 8) | 161260 |
| Hexadecimal (base 16) | E2B0 |
| Base 3 | 2221121100 |
| As time | 58032 seconds = 16 h 7 min 12 s |
Is 58032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58032 ÷ 2 = 29016) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (58032 ÷ 3 = 19344) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (58032 ÷ 4 = 14508) | 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 (58032 ÷ 6 = 9672) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (58032 ÷ 8 = 7254) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (58032 ÷ 9 = 6448) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (58032 ÷ 12 = 4836) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58032 a prime number?
No. 58032 = × × 13 × 31, so it is divisible by 2.
What are the factors of 58032?
1, 2, 3, 4, 6, 8, 9, 12, 13, 16, 18, 24, 26, 31, 36, 39, 48, 52, 62, 72, 78, 93, 104, 117, 124, 144, 156, 186, 208, 234, 248, 279, 312, 372, 403, 468, 496, 558, 624, 744, 806, 936, 1116, 1209, 1488, 1612, 1872, 2232, 2418, 3224, 3627, 4464, 4836, 6448, 7254, 9672, 14508, 19344, 29016, 58032.
What is 58032 in binary?
1110001010110000 (hexadecimal E2B0, octal 161260).
What is the square root of 58032?
About 240.8983, exactly 12√403.
Is 58032 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 58032?
58032 is a Harshad number: divisible by its digit sum 18.