The number 50832
50832 is a composite number with 30 divisors. Its prime factorisation is × × 353. Divisors (30): 1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 353 … 50832.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50832: a Harshad number: divisible by its digit sum 18.
- 2
50832 is composite. Its prime factorisation is
- 3
The divisors add up to 142662; without 50832 itself that is 91830, so 50832 is abundant (91830 is more than 50832). Euler's totient φ(50832) = 16896 numbers up to 50832 share no factor with it.
- 4
The digits of 50832 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50832 = 2^{4} \times 3^{2} \times 353 \]50832 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 142662 |
| Euler totient φ(n) | 16896 |
| Square | 2583892224 |
| Cube | 131344409530368 |
| Square root | 225.459531 (= 12√353) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 57 |
| Scientific notation | 5.0832 × |
50832 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and thirty-two |
| Binary (base 2) | 1100011010010000 |
| Octal (base 8) | 143220 |
| Hexadecimal (base 16) | C690 |
| Base 3 | 2120201200 |
| As time | 50832 seconds = 14 h 7 min 12 s |
Is 50832 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50832 ÷ 2 = 25416) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50832 ÷ 3 = 16944) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50832 ÷ 4 = 12708) | 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 (50832 ÷ 6 = 8472) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (50832 ÷ 8 = 6354) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50832 ÷ 9 = 5648) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50832 ÷ 12 = 4236) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50832 a prime number?
No. 50832 = × × 353, so it is divisible by 2.
What are the factors of 50832?
1, 2, 3, 4, 6, 8, 9, 12, 16, 18, 24, 36, 48, 72, 144, 353, 706, 1059, 1412, 2118, 2824, 3177, 4236, 5648, 6354, 8472, 12708, 16944, 25416, 50832.
What is 50832 in binary?
1100011010010000 (hexadecimal C690, octal 143220).
What is the square root of 50832?
About 225.4595, exactly 12√353.
Is 50832 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50832?
50832 is a Harshad number: divisible by its digit sum 18.