The number 15968
15968 is a composite number with 12 divisors. Its prime factorisation is × 499. Divisors (12): 1, 2, 4, 8, 16, 32, 499, 998, 1996, 3992, 7984, 15968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15968 is composite. Its prime factorisation is
- 3
The divisors add up to 31500; without 15968 itself that is 15532, so 15968 is deficient (15532 is less than 15968). Euler's totient φ(15968) = 7968 numbers up to 15968 share no factor with it.
- 4
The digits of 15968 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15968 = 2^{5} \times 499 \]15968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 31500 |
| Euler totient φ(n) | 7968 |
| Square | 254977024 |
| Cube | 4071473119232 |
| Square root | 126.364552 (= 4√998) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5968 × |
15968 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and sixty-eight |
| Binary (base 2) | 11111001100000 |
| Octal (base 8) | 37140 |
| Hexadecimal (base 16) | 3E60 |
| Base 3 | 210220102 |
| As time | 15968 seconds = 4 h 26 min 8 s |
Is 15968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15968 ÷ 2 = 7984) | 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 | Yes (15968 ÷ 4 = 3992) | 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 2) | 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 | Yes (15968 ÷ 8 = 1996) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15968 a prime number?
No. 15968 = × 499, so it is divisible by 2.
What are the factors of 15968?
1, 2, 4, 8, 16, 32, 499, 998, 1996, 3992, 7984, 15968.
What is 15968 in binary?
11111001100000 (hexadecimal 3E60, octal 37140).
What is the square root of 15968?
About 126.3646, exactly 4√998.
Is 15968 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 15968?
It is a composite number with 12 divisors.