The number 10460
10460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 523. Divisors (12): 1, 2, 4, 5, 10, 20, 523, 1046, 2092, 2615, 5230, 10460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10460 is composite. Its prime factorisation is
- 3
The divisors add up to 22008; without 10460 itself that is 11548, so 10460 is abundant (11548 is more than 10460). Euler's totient φ(10460) = 4176 numbers up to 10460 share no factor with it.
- 4
The digits of 10460 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10460 = 2^{2} \times 5 \times 523 \]10460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 22008 |
| Euler totient φ(n) | 4176 |
| Square | 109411600 |
| Cube | 1144445336000 |
| Square root | 102.274141 (= 2√2615) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 179 |
| Scientific notation | 1.046 × |
10460 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and sixty |
| Binary (base 2) | 10100011011100 |
| Octal (base 8) | 24334 |
| Hexadecimal (base 16) | 28DC |
| Base 3 | 112100102 |
| As time | 10460 seconds = 2 h 54 min 20 s |
Is 10460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10460 ÷ 2 = 5230) | 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 | Yes (10460 ÷ 4 = 2615) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10460 ÷ 5 = 2092) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | 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 | Yes (10460 ÷ 10 = 1046) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10460 a prime number?
No. 10460 = × 5 × 523, so it is divisible by 2.
What are the factors of 10460?
1, 2, 4, 5, 10, 20, 523, 1046, 2092, 2615, 5230, 10460.
What is 10460 in binary?
10100011011100 (hexadecimal 28DC, octal 24334).
What is the square root of 10460?
About 102.2741, exactly 2√2615.
Is 10460 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 10460?
It is a composite number with 12 divisors.