The number 32981
32981 is a composite number with 8 divisors. Its prime factorisation is 13 × 43 × 59. Divisors (8): 1, 13, 43, 59, 559, 767, 2537, 32981.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32981 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32981 is composite. Its prime factorisation is
- 3
The divisors add up to 36960; without 32981 itself that is 3979, so 32981 is deficient (3979 is less than 32981). Euler's totient φ(32981) = 29232 numbers up to 32981 share no factor with it.
- 4
The digits of 32981 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32981 = 13 \times 43 \times 59 \]
32981 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 36960 |
| Euler totient φ(n) | 29232 |
| Square | 1087746361 |
| Cube | 35874962732141 |
| Square root | 181.606718 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 129 |
| Scientific notation | 3.2981 × |
32981 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand nine hundred and eighty-one |
| Binary (base 2) | 1000000011010101 |
| Octal (base 8) | 100325 |
| Hexadecimal (base 16) | 80D5 |
| Base 3 | 1200020112 |
| As time | 32981 seconds = 9 h 9 min 41 s |
Is 32981 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 5) | 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 | No (remainder 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32981 a prime number?
No. 32981 = 13 × 43 × 59, so it is divisible by 13.
What are the factors of 32981?
1, 13, 43, 59, 559, 767, 2537, 32981.
What is 32981 in binary?
1000000011010101 (hexadecimal 80D5, octal 100325).
What is the square root of 32981?
About 181.6067.
Is 32981 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 32981?
It is a composite number with 8 divisors.