The number 1963
1963 is a composite number with 4 divisors. Its prime factorisation is 13 × 151. Divisors (4): 1, 13, 151, 1963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1963: a semiprime: 13 × 151, the product of two primes.
- 2
1963 is composite. Its prime factorisation is
- 3
The divisors add up to 2128; without 1963 itself that is 165, so 1963 is deficient (165 is less than 1963). Euler's totient φ(1963) = 1800 numbers up to 1963 share no factor with it.
- 4
The digits of 1963 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1963 = 13 \times 151 \]
1963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2128 |
| Euler totient φ(n) | 1800 |
| Square | 3853369 |
| Cube | 7564163347 |
| Square root | 44.305756 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.963 × |
1963 in other forms
| Form | Value |
|---|---|
| In words | one thousand nine hundred and sixty-three |
| Roman numerals | MCMLXIII |
| Binary (base 2) | 11110101011 |
| Octal (base 8) | 3653 |
| Hexadecimal (base 16) | 7AB |
| Base 3 | 2200201 |
| As time | 1963 seconds = 32 min 43 s |
Is 1963 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | No (remainder 1) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1963 a prime number?
No. 1963 = 13 × 151, so it is divisible by 13.
What are the factors of 1963?
1, 13, 151, 1963.
What is 1963 in binary?
11110101011 (hexadecimal 7AB, octal 3653).
What is the square root of 1963?
About 44.3058.
What is 1963 in Roman numerals?
MCMLXIII.
Is 1963 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 1963?
1963 is a semiprime: 13 × 151, the product of two primes.