The number 32151
32151 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 1531. Divisors (8): 1, 3, 7, 21, 1531, 4593, 10717, 32151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32151 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32151 is composite. Its prime factorisation is
- 3
The divisors add up to 49024; without 32151 itself that is 16873, so 32151 is deficient (16873 is less than 32151). Euler's totient φ(32151) = 18360 numbers up to 32151 share no factor with it.
- 4
The digits of 32151 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 191 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32151 = 3 \times 7 \times 1531 \]
32151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 49024 |
| Euler totient φ(n) | 18360 |
| Square | 1033686801 |
| Cube | 33234064338951 |
| Square root | 179.306999 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 191 |
| Scientific notation | 3.2151 × |
32151 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand one hundred and fifty-one |
| Binary (base 2) | 111110110010111 |
| Octal (base 8) | 76627 |
| Hexadecimal (base 16) | 7D97 |
| Base 3 | 1122002210 |
| As time | 32151 seconds = 8 h 55 min 51 s |
Is 32151 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 | Yes (32151 ÷ 3 = 10717) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (32151 ÷ 7 = 4593) | 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 3) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32151 a prime number?
No. 32151 = 3 × 7 × 1531, so it is divisible by 3.
What are the factors of 32151?
1, 3, 7, 21, 1531, 4593, 10717, 32151.
What is 32151 in binary?
111110110010111 (hexadecimal 7D97, octal 76627).
What is the square root of 32151?
About 179.3070.
Is 32151 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 32151?
It is a composite number with 8 divisors.