The number 8463
8463 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 13 × 31. Divisors (16): 1, 3, 7, 13, 21, 31, 39, 91, 93, 217, 273, 403, 651, 1209, 2821, 8463.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8463: a Harshad number: divisible by its digit sum 21.
- 2
8463 is composite. Its prime factorisation is
- 3
The divisors add up to 14336; without 8463 itself that is 5873, so 8463 is deficient (5873 is less than 8463). Euler's totient φ(8463) = 4320 numbers up to 8463 share no factor with it.
- 4
The digits of 8463 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8463 = 3 \times 7 \times 13 \times 31 \]
8463 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 14336 |
| Euler totient φ(n) | 4320 |
| Square | 71622369 |
| Cube | 606140108847 |
| Square root | 91.994565 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 39 |
| Scientific notation | 8.463 × |
8463 in other forms
| Form | Value |
|---|---|
| In words | eight thousand four hundred and sixty-three |
| Binary (base 2) | 10000100001111 |
| Octal (base 8) | 20417 |
| Hexadecimal (base 16) | 210F |
| Base 3 | 102121110 |
| As time | 8463 seconds = 2 h 21 min 3 s |
Is 8463 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 (8463 ÷ 3 = 2821) | 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 3) | 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 | Yes (8463 ÷ 7 = 1209) | 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 7) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8463 a prime number?
No. 8463 = 3 × 7 × 13 × 31, so it is divisible by 3.
What are the factors of 8463?
1, 3, 7, 13, 21, 31, 39, 91, 93, 217, 273, 403, 651, 1209, 2821, 8463.
What is 8463 in binary?
10000100001111 (hexadecimal 210F, octal 20417).
What is the square root of 8463?
About 91.9946.
Is 8463 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 8463?
8463 is a Harshad number: divisible by its digit sum 21.