The number 32190
32190 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 29 × 37. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 29, 30, 37, 58, 74, 87, 111, 145, 174 … 32190.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32190: a Harshad number: divisible by its digit sum 15.
- 2
32190 is composite. Its prime factorisation is
- 3
The divisors add up to 82080; without 32190 itself that is 49890, so 32190 is abundant (49890 is more than 32190). Euler's totient φ(32190) = 8064 numbers up to 32190 share no factor with it.
- 4
The digits of 32190 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32190 = 2 \times 3 \times 5 \times 29 \times 37 \]
32190 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 82080 |
| Euler totient φ(n) | 8064 |
| Square | 1036196100 |
| Cube | 33355152459000 |
| Square root | 179.415718 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 46 |
| Scientific notation | 3.219 × |
32190 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand one hundred and ninety |
| Binary (base 2) | 111110110111110 |
| Octal (base 8) | 76676 |
| Hexadecimal (base 16) | 7DBE |
| Base 3 | 1122011020 |
| As time | 32190 seconds = 8 h 56 min 30 s |
Is 32190 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32190 ÷ 2 = 16095) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (32190 ÷ 3 = 10730) | 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 (32190 ÷ 5 = 6438) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (32190 ÷ 6 = 5365) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (32190 ÷ 10 = 3219) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32190 a prime number?
No. 32190 = 2 × 3 × 5 × 29 × 37, so it is divisible by 2.
What are the factors of 32190?
1, 2, 3, 5, 6, 10, 15, 29, 30, 37, 58, 74, 87, 111, 145, 174, 185, 222, 290, 370, 435, 555, 870, 1073, 1110, 2146, 3219, 5365, 6438, 10730, 16095, 32190.
What is 32190 in binary?
111110110111110 (hexadecimal 7DBE, octal 76676).
What is the square root of 32190?
About 179.4157.
Is 32190 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 32190?
32190 is a Harshad number: divisible by its digit sum 15.