The number 10461
10461 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 317. Divisors (8): 1, 3, 11, 33, 317, 951, 3487, 10461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10461 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10461 is composite. Its prime factorisation is
- 3
The divisors add up to 15264; without 10461 itself that is 4803, so 10461 is deficient (4803 is less than 10461). Euler's totient φ(10461) = 6320 numbers up to 10461 share no factor with it.
- 4
The digits of 10461 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 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10461 = 3 \times 11 \times 317 \]
10461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15264 |
| Euler totient φ(n) | 6320 |
| Square | 109432521 |
| Cube | 1144773602181 |
| Square root | 102.279030 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 179 |
| Scientific notation | 1.0461 × |
10461 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and sixty-one |
| Binary (base 2) | 10100011011101 |
| Octal (base 8) | 24335 |
| Hexadecimal (base 16) | 28DD |
| Base 3 | 112100110 |
| As time | 10461 seconds = 2 h 54 min 21 s |
Is 10461 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 (10461 ÷ 3 = 3487) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 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 | Yes (10461 ÷ 11 = 951) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10461 a prime number?
No. 10461 = 3 × 11 × 317, so it is divisible by 3.
What are the factors of 10461?
1, 3, 11, 33, 317, 951, 3487, 10461.
What is 10461 in binary?
10100011011101 (hexadecimal 28DD, octal 24335).
What is the square root of 10461?
About 102.2790.
Is 10461 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 10461?
It is a composite number with 8 divisors.