The number 32270
32270 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 461. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 461, 922, 2305, 3227, 4610, 6454, 16135, 32270.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32270: a Harshad number: divisible by its digit sum 14.
- 2
32270 is composite. Its prime factorisation is
- 3
The divisors add up to 66528; without 32270 itself that is 34258, so 32270 is abundant (34258 is more than 32270). Euler's totient φ(32270) = 11040 numbers up to 32270 share no factor with it.
- 4
The digits of 32270 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 72 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32270 = 2 \times 5 \times 7 \times 461 \]
32270 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 66528 |
| Euler totient φ(n) | 11040 |
| Square | 1041352900 |
| Cube | 33604458083000 |
| Square root | 179.638526 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 72 |
| Scientific notation | 3.227 × |
32270 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand two hundred and seventy |
| Binary (base 2) | 111111000001110 |
| Octal (base 8) | 77016 |
| Hexadecimal (base 16) | 7E0E |
| Base 3 | 1122021012 |
| As time | 32270 seconds = 8 h 57 min 50 s |
Is 32270 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32270 ÷ 2 = 16135) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (32270 ÷ 5 = 6454) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (32270 ÷ 7 = 4610) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (32270 ÷ 10 = 3227) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32270 a prime number?
No. 32270 = 2 × 5 × 7 × 461, so it is divisible by 2.
What are the factors of 32270?
1, 2, 5, 7, 10, 14, 35, 70, 461, 922, 2305, 3227, 4610, 6454, 16135, 32270.
What is 32270 in binary?
111111000001110 (hexadecimal 7E0E, octal 77016).
What is the square root of 32270?
About 179.6385.
Is 32270 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 32270?
32270 is a Harshad number: divisible by its digit sum 14.