The number 10963
10963 is a composite number with 4 divisors. Its prime factorisation is 19 × 577. Divisors (4): 1, 19, 577, 10963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10963: a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 577, the product of two primes.
- 2
10963 is composite. Its prime factorisation is
- 3
The divisors add up to 11560; without 10963 itself that is 597, so 10963 is deficient (597 is less than 10963). Euler's totient φ(10963) = 10368 numbers up to 10963 share no factor with it.
- 4
The digits of 10963 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 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10963 = 19 \times 577 \]
10963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11560 |
| Euler totient φ(n) | 10368 |
| Square | 120187369 |
| Cube | 1317614126347 |
| Square root | 104.704346 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.0963 × |
10963 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and sixty-three |
| Binary (base 2) | 10101011010011 |
| Octal (base 8) | 25323 |
| Hexadecimal (base 16) | 2AD3 |
| Base 3 | 120001001 |
| As time | 10963 seconds = 3 h 2 min 43 s |
Is 10963 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 1) | 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 7) | 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 10963 a prime number?
No. 10963 = 19 × 577, so it is divisible by 19.
What are the factors of 10963?
1, 19, 577, 10963.
What is 10963 in binary?
10101011010011 (hexadecimal 2AD3, octal 25323).
What is the square root of 10963?
About 104.7043.
Is 10963 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 10963?
10963 is a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 577, the product of two primes.