The number 32461
32461 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 227. Divisors (8): 1, 11, 13, 143, 227, 2497, 2951, 32461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32461 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32461 is composite. Its prime factorisation is
- 3
The divisors add up to 38304; without 32461 itself that is 5843, so 32461 is deficient (5843 is less than 32461). Euler's totient φ(32461) = 27120 numbers up to 32461 share no factor with it.
- 4
The digits of 32461 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32461 = 11 \times 13 \times 227 \]
32461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 38304 |
| Euler totient φ(n) | 27120 |
| Square | 1053716521 |
| Cube | 34204691988181 |
| Square root | 180.169365 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 116 |
| Scientific notation | 3.2461 × |
32461 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand four hundred and sixty-one |
| Binary (base 2) | 111111011001101 |
| Octal (base 8) | 77315 |
| Hexadecimal (base 16) | 7ECD |
| Base 3 | 1122112021 |
| As time | 32461 seconds = 9 h 1 min 1 s |
Is 32461 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 1) | 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 | Yes (32461 ÷ 11 = 2951) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32461 a prime number?
No. 32461 = 11 × 13 × 227, so it is divisible by 11.
What are the factors of 32461?
1, 11, 13, 143, 227, 2497, 2951, 32461.
What is 32461 in binary?
111111011001101 (hexadecimal 7ECD, octal 77315).
What is the square root of 32461?
About 180.1694.
Is 32461 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 32461?
It is a composite number with 8 divisors.