The number 32050
32050 is a composite number with 12 divisors. Its prime factorisation is 2 × × 641. Divisors (12): 1, 2, 5, 10, 25, 50, 641, 1282, 3205, 6410, 16025, 32050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32050: a Harshad number: divisible by its digit sum 10.
- 2
32050 is composite. Its prime factorisation is
- 3
The divisors add up to 59706; without 32050 itself that is 27656, so 32050 is deficient (27656 is less than 32050). Euler's totient φ(32050) = 12800 numbers up to 32050 share no factor with it.
- 4
The digits of 32050 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 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32050 = 2 \times 5^{2} \times 641 \]32050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 59706 |
| Euler totient φ(n) | 12800 |
| Square | 1027202500 |
| Cube | 32921840125000 |
| Square root | 179.025138 (= 5√1282) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 98 |
| Scientific notation | 3.205 × |
32050 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand and fifty |
| Binary (base 2) | 111110100110010 |
| Octal (base 8) | 76462 |
| Hexadecimal (base 16) | 7D32 |
| Base 3 | 1121222001 |
| As time | 32050 seconds = 8 h 54 min 10 s |
Is 32050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32050 ÷ 2 = 16025) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (32050 ÷ 5 = 6410) | 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 4) | 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 | No (remainder 2) | 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 | Yes (32050 ÷ 10 = 3205) | 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 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32050 a prime number?
No. 32050 = 2 × × 641, so it is divisible by 2.
What are the factors of 32050?
1, 2, 5, 10, 25, 50, 641, 1282, 3205, 6410, 16025, 32050.
What is 32050 in binary?
111110100110010 (hexadecimal 7D32, octal 76462).
What is the square root of 32050?
About 179.0251, exactly 5√1282.
Is 32050 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 32050?
32050 is a Harshad number: divisible by its digit sum 10.