The number 32951
32951 is a composite number with 4 divisors. Its prime factorisation is 83 × 397. Divisors (4): 1, 83, 397, 32951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32951: a semiprime: 83 × 397, the product of two primes.
- 2
32951 is composite. Its prime factorisation is
- 3
The divisors add up to 33432; without 32951 itself that is 481, so 32951 is deficient (481 is less than 32951). Euler's totient φ(32951) = 32472 numbers up to 32951 share no factor with it.
- 4
The digits of 32951 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32951 = 83 \times 397 \]
32951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 33432 |
| Euler totient φ(n) | 32472 |
| Square | 1085768401 |
| Cube | 35777154581351 |
| Square root | 181.524103 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 98 |
| Scientific notation | 3.2951 × |
32951 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand nine hundred and fifty-one |
| Binary (base 2) | 1000000010110111 |
| Octal (base 8) | 100267 |
| Hexadecimal (base 16) | 80B7 |
| Base 3 | 1200012102 |
| As time | 32951 seconds = 9 h 9 min 11 s |
Is 32951 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 3) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32951 a prime number?
No. 32951 = 83 × 397, so it is divisible by 83.
What are the factors of 32951?
1, 83, 397, 32951.
What is 32951 in binary?
1000000010110111 (hexadecimal 80B7, octal 100267).
What is the square root of 32951?
About 181.5241.
Is 32951 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 32951?
32951 is a semiprime: 83 × 397, the product of two primes.