The number 32153
32153 is a composite number with 8 divisors. Its prime factorisation is 11 × 37 × 79. Divisors (8): 1, 11, 37, 79, 407, 869, 2923, 32153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32153 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32153 is composite. Its prime factorisation is
- 3
The divisors add up to 36480; without 32153 itself that is 4327, so 32153 is deficient (4327 is less than 32153). Euler's totient φ(32153) = 28080 numbers up to 32153 share no factor with it.
- 4
The digits of 32153 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 191 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32153 = 11 \times 37 \times 79 \]
32153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 36480 |
| Euler totient φ(n) | 28080 |
| Square | 1033815409 |
| Cube | 33240266845577 |
| Square root | 179.312576 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 191 |
| Scientific notation | 3.2153 × |
32153 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand one hundred and fifty-three |
| Binary (base 2) | 111110110011001 |
| Octal (base 8) | 76631 |
| Hexadecimal (base 16) | 7D99 |
| Base 3 | 1122002212 |
| As time | 32153 seconds = 8 h 55 min 53 s |
Is 32153 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 3) | 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (32153 ÷ 11 = 2923) | 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 32153 a prime number?
No. 32153 = 11 × 37 × 79, so it is divisible by 11.
What are the factors of 32153?
1, 11, 37, 79, 407, 869, 2923, 32153.
What is 32153 in binary?
111110110011001 (hexadecimal 7D99, octal 76631).
What is the square root of 32153?
About 179.3126.
Is 32153 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 32153?
It is a composite number with 8 divisors.