The number 32230
32230 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 293. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 293, 586, 1465, 2930, 3223, 6446, 16115, 32230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32230: a Harshad number: divisible by its digit sum 10.
- 2
32230 is composite. Its prime factorisation is
- 3
The divisors add up to 63504; without 32230 itself that is 31274, so 32230 is deficient (31274 is less than 32230). Euler's totient φ(32230) = 11680 numbers up to 32230 share no factor with it.
- 4
The digits of 32230 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 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32230 = 2 \times 5 \times 11 \times 293 \]
32230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 63504 |
| Euler totient φ(n) | 11680 |
| Square | 1038772900 |
| Cube | 33479650567000 |
| Square root | 179.527157 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 129 |
| Scientific notation | 3.223 × |
32230 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand two hundred and thirty |
| Binary (base 2) | 111110111100110 |
| Octal (base 8) | 76746 |
| Hexadecimal (base 16) | 7DE6 |
| Base 3 | 1122012201 |
| As time | 32230 seconds = 8 h 57 min 10 s |
Is 32230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32230 ÷ 2 = 16115) | 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 (32230 ÷ 5 = 6446) | 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 2) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (32230 ÷ 10 = 3223) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (32230 ÷ 11 = 2930) | 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 32230 a prime number?
No. 32230 = 2 × 5 × 11 × 293, so it is divisible by 2.
What are the factors of 32230?
1, 2, 5, 10, 11, 22, 55, 110, 293, 586, 1465, 2930, 3223, 6446, 16115, 32230.
What is 32230 in binary?
111110111100110 (hexadecimal 7DE6, octal 76746).
What is the square root of 32230?
About 179.5272.
Is 32230 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 32230?
32230 is a Harshad number: divisible by its digit sum 10.