The number 15963
15963 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 313. Divisors (8): 1, 3, 17, 51, 313, 939, 5321, 15963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15963 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15963 is composite. Its prime factorisation is
- 3
The divisors add up to 22608; without 15963 itself that is 6645, so 15963 is deficient (6645 is less than 15963). Euler's totient φ(15963) = 9984 numbers up to 15963 share no factor with it.
- 4
The digits of 15963 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15963 = 3 \times 17 \times 313 \]
15963 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22608 |
| Euler totient φ(n) | 9984 |
| Square | 254817369 |
| Cube | 4067649661347 |
| Square root | 126.344766 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.5963 × |
15963 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and sixty-three |
| Binary (base 2) | 11111001011011 |
| Octal (base 8) | 37133 |
| Hexadecimal (base 16) | 3E5B |
| Base 3 | 210220020 |
| As time | 15963 seconds = 4 h 26 min 3 s |
Is 15963 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 (15963 ÷ 3 = 5321) | 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 | 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 6) | 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 2) | 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 15963 a prime number?
No. 15963 = 3 × 17 × 313, so it is divisible by 3.
What are the factors of 15963?
1, 3, 17, 51, 313, 939, 5321, 15963.
What is 15963 in binary?
11111001011011 (hexadecimal 3E5B, octal 37133).
What is the square root of 15963?
About 126.3448.
Is 15963 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 15963?
It is a composite number with 8 divisors.