The number 1463
1463 is a composite number with 8 divisors. Its prime factorisation is 7 × 11 × 19. Divisors (8): 1, 7, 11, 19, 77, 133, 209, 1463.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1463 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1463 is composite. Its prime factorisation is
- 3
The divisors add up to 1920; without 1463 itself that is 457, so 1463 is deficient (457 is less than 1463). Euler's totient φ(1463) = 1080 numbers up to 1463 share no factor with it.
- 4
The digits of 1463 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1463 = 7 \times 11 \times 19 \]
1463 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 1920 |
| Euler totient φ(n) | 1080 |
| Square | 2140369 |
| Cube | 3131359847 |
| Square root | 38.249183 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 140 |
| Scientific notation | 1.463 × |
1463 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and sixty-three |
| Roman numerals | MCDLXIII |
| Binary (base 2) | 10110110111 |
| Octal (base 8) | 2667 |
| Hexadecimal (base 16) | 5B7 |
| Base 3 | 2000012 |
| As time | 1463 seconds = 24 min 23 s |
Is 1463 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (1463 ÷ 7 = 209) | 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 5) | 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 | Yes (1463 ÷ 11 = 133) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1463 a prime number?
No. 1463 = 7 × 11 × 19, so it is divisible by 7.
What are the factors of 1463?
1, 7, 11, 19, 77, 133, 209, 1463.
What is 1463 in binary?
10110110111 (hexadecimal 5B7, octal 2667).
What is the square root of 1463?
About 38.2492.
What is 1463 in Roman numerals?
MCDLXIII.
Is 1463 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 1463?
It is a composite number with 8 divisors.