The number 10467
10467 is a composite number with 6 divisors. Its prime factorisation is × 1163. Divisors (6): 1, 3, 9, 1163, 3489, 10467.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10467 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10467 is composite. Its prime factorisation is
- 3
The divisors add up to 15132; without 10467 itself that is 4665, so 10467 is deficient (4665 is less than 10467). Euler's totient φ(10467) = 6972 numbers up to 10467 share no factor with it.
- 4
The digits of 10467 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10467 = 3^{2} \times 1163 \]10467 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 15132 |
| Euler totient φ(n) | 6972 |
| Square | 109558089 |
| Cube | 1146744517563 |
| Square root | 102.308357 (= 3√1163) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.0467 × |
10467 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and sixty-seven |
| Binary (base 2) | 10100011100011 |
| Octal (base 8) | 24343 |
| Hexadecimal (base 16) | 28E3 |
| Base 3 | 112100200 |
| As time | 10467 seconds = 2 h 54 min 27 s |
Is 10467 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 (10467 ÷ 3 = 3489) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (10467 ÷ 9 = 1163) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10467 a prime number?
No. 10467 = × 1163, so it is divisible by 3.
What are the factors of 10467?
1, 3, 9, 1163, 3489, 10467.
What is 10467 in binary?
10100011100011 (hexadecimal 28E3, octal 24343).
What is the square root of 10467?
About 102.3084, exactly 3√1163.
Is 10467 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 10467?
It is a composite number with 6 divisors.