The number 10465
10465 is a composite number with 16 divisors. Its prime factorisation is 5 × 7 × 13 × 23. Divisors (16): 1, 5, 7, 13, 23, 35, 65, 91, 115, 161, 299, 455, 805, 1495, 2093, 10465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10465 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10465 is composite. Its prime factorisation is
- 3
The divisors add up to 16128; without 10465 itself that is 5663, so 10465 is deficient (5663 is less than 10465). Euler's totient φ(10465) = 6336 numbers up to 10465 share no factor with it.
- 4
The digits of 10465 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10465 = 5 \times 7 \times 13 \times 23 \]
10465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 16128 |
| Euler totient φ(n) | 6336 |
| Square | 109516225 |
| Cube | 1146087294625 |
| Square root | 102.298583 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.0465 × |
10465 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and sixty-five |
| Binary (base 2) | 10100011100001 |
| Octal (base 8) | 24341 |
| Hexadecimal (base 16) | 28E1 |
| Base 3 | 112100121 |
| As time | 10465 seconds = 2 h 54 min 25 s |
Is 10465 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 | Yes (10465 ÷ 5 = 2093) | 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 | Yes (10465 ÷ 7 = 1495) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 10465 a prime number?
No. 10465 = 5 × 7 × 13 × 23, so it is divisible by 5.
What are the factors of 10465?
1, 5, 7, 13, 23, 35, 65, 91, 115, 161, 299, 455, 805, 1495, 2093, 10465.
What is 10465 in binary?
10100011100001 (hexadecimal 28E1, octal 24341).
What is the square root of 10465?
About 102.2986.
Is 10465 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 10465?
It is a composite number with 16 divisors.