The number 32500
32500 is a composite number with 30 divisors. Its prime factorisation is × × 13. Divisors (30): 1, 2, 4, 5, 10, 13, 20, 25, 26, 50, 52, 65, 100, 125, 130, 250 … 32500.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32500: a Harshad number: divisible by its digit sum 10.
- 2
32500 is composite. Its prime factorisation is
- 3
The divisors add up to 76538; without 32500 itself that is 44038, so 32500 is abundant (44038 is more than 32500). Euler's totient φ(32500) = 12000 numbers up to 32500 share no factor with it.
- 4
The digits of 32500 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32500 = 2^{2} \times 5^{4} \times 13 \]32500 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 76538 |
| Euler totient φ(n) | 12000 |
| Square | 1056250000 |
| Cube | 34328125000000 |
| Square root | 180.277564 (= 50√13) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.25 × |
32500 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand five hundred |
| Binary (base 2) | 111111011110100 |
| Octal (base 8) | 77364 |
| Hexadecimal (base 16) | 7EF4 |
| Base 3 | 1122120201 |
| As time | 32500 seconds = 9 h 1 min 40 s |
Is 32500 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32500 ÷ 2 = 16250) | 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 (32500 ÷ 4 = 8125) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (32500 ÷ 5 = 6500) | 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 6) | 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 4) | 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 (32500 ÷ 10 = 3250) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 32500 a prime number?
No. 32500 = × × 13, so it is divisible by 2.
What are the factors of 32500?
1, 2, 4, 5, 10, 13, 20, 25, 26, 50, 52, 65, 100, 125, 130, 250, 260, 325, 500, 625, 650, 1250, 1300, 1625, 2500, 3250, 6500, 8125, 16250, 32500.
What is 32500 in binary?
111111011110100 (hexadecimal 7EF4, octal 77364).
What is the square root of 32500?
About 180.2776, exactly 50√13.
Is 32500 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 32500?
32500 is a Harshad number: divisible by its digit sum 10.