The number 50032
50032 is a composite number with 20 divisors. Its prime factorisation is × 53 × 59. Divisors (20): 1, 2, 4, 8, 16, 53, 59, 106, 118, 212, 236, 424, 472, 848, 944, 3127 … 50032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50032 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50032 is composite. Its prime factorisation is
- 3
The divisors add up to 100440; without 50032 itself that is 50408, so 50032 is abundant (50408 is more than 50032). Euler's totient φ(50032) = 24128 numbers up to 50032 share no factor with it.
- 4
The digits of 50032 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50032 = 2^{4} \times 53 \times 59 \]50032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 100440 |
| Euler totient φ(n) | 24128 |
| Square | 2503201024 |
| Cube | 125240153632768 |
| Square root | 223.678340 (= 4√3127) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0032 × |
50032 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and thirty-two |
| Binary (base 2) | 1100001101110000 |
| Octal (base 8) | 141560 |
| Hexadecimal (base 16) | C370 |
| Base 3 | 2112122001 |
| As time | 50032 seconds = 13 h 53 min 52 s |
Is 50032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50032 ÷ 2 = 25016) | 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 (50032 ÷ 4 = 12508) | 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 3) | 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 (50032 ÷ 8 = 6254) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 4) | 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 50032 a prime number?
No. 50032 = × 53 × 59, so it is divisible by 2.
What are the factors of 50032?
1, 2, 4, 8, 16, 53, 59, 106, 118, 212, 236, 424, 472, 848, 944, 3127, 6254, 12508, 25016, 50032.
What is 50032 in binary?
1100001101110000 (hexadecimal C370, octal 141560).
What is the square root of 50032?
About 223.6783, exactly 4√3127.
Is 50032 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 50032?
It is a composite number with 20 divisors.