The number 32070
32070 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1069. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1069, 2138, 3207, 5345, 6414, 10690, 16035, 32070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32070 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32070 is composite. Its prime factorisation is
- 3
The divisors add up to 77040; without 32070 itself that is 44970, so 32070 is abundant (44970 is more than 32070). Euler's totient φ(32070) = 8544 numbers up to 32070 share no factor with it.
- 4
The digits of 32070 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32070 = 2 \times 3 \times 5 \times 1069 \]
32070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 77040 |
| Euler totient φ(n) | 8544 |
| Square | 1028484900 |
| Cube | 32983510743000 |
| Square root | 179.080987 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 147 |
| Scientific notation | 3.207 × |
32070 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand and seventy |
| Binary (base 2) | 111110101000110 |
| Octal (base 8) | 76506 |
| Hexadecimal (base 16) | 7D46 |
| Base 3 | 1121222210 |
| As time | 32070 seconds = 8 h 54 min 30 s |
Is 32070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32070 ÷ 2 = 16035) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (32070 ÷ 3 = 10690) | 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 (32070 ÷ 5 = 6414) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (32070 ÷ 6 = 5345) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (32070 ÷ 10 = 3207) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 32070 a prime number?
No. 32070 = 2 × 3 × 5 × 1069, so it is divisible by 2.
What are the factors of 32070?
1, 2, 3, 5, 6, 10, 15, 30, 1069, 2138, 3207, 5345, 6414, 10690, 16035, 32070.
What is 32070 in binary?
111110101000110 (hexadecimal 7D46, octal 76506).
What is the square root of 32070?
About 179.0810.
Is 32070 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 32070?
It is a composite number with 16 divisors.