The number 32970
32970 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 7 × 157. Divisors (32): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 157 … 32970.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32970: a Harshad number: divisible by its digit sum 21.
- 2
32970 is composite. Its prime factorisation is
- 3
The divisors add up to 91008; without 32970 itself that is 58038, so 32970 is abundant (58038 is more than 32970). Euler's totient φ(32970) = 7488 numbers up to 32970 share no factor with it.
- 4
The digits of 32970 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32970 = 2 \times 3 \times 5 \times 7 \times 157 \]
32970 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 91008 |
| Euler totient φ(n) | 7488 |
| Square | 1087020900 |
| Cube | 35839079073000 |
| Square root | 181.576430 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.297 × |
32970 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand nine hundred and seventy |
| Binary (base 2) | 1000000011001010 |
| Octal (base 8) | 100312 |
| Hexadecimal (base 16) | 80CA |
| Base 3 | 1200020010 |
| As time | 32970 seconds = 9 h 9 min 30 s |
Is 32970 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32970 ÷ 2 = 16485) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (32970 ÷ 3 = 10990) | 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 (32970 ÷ 5 = 6594) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (32970 ÷ 6 = 5495) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (32970 ÷ 7 = 4710) | 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 2) | 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 (32970 ÷ 10 = 3297) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 32970 a prime number?
No. 32970 = 2 × 3 × 5 × 7 × 157, so it is divisible by 2.
What are the factors of 32970?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 157, 210, 314, 471, 785, 942, 1099, 1570, 2198, 2355, 3297, 4710, 5495, 6594, 10990, 16485, 32970.
What is 32970 in binary?
1000000011001010 (hexadecimal 80CA, octal 100312).
What is the square root of 32970?
About 181.5764.
Is 32970 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 32970?
32970 is a Harshad number: divisible by its digit sum 21.