The number 15964
15964 is a composite number with 12 divisors. Its prime factorisation is × 13 × 307. Divisors (12): 1, 2, 4, 13, 26, 52, 307, 614, 1228, 3991, 7982, 15964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15964 is composite. Its prime factorisation is
- 3
The divisors add up to 30184; without 15964 itself that is 14220, so 15964 is deficient (14220 is less than 15964). Euler's totient φ(15964) = 7344 numbers up to 15964 share no factor with it.
- 4
The digits of 15964 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15964 = 2^{2} \times 13 \times 307 \]15964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 30184 |
| Euler totient φ(n) | 7344 |
| Square | 254849296 |
| Cube | 4068414161344 |
| Square root | 126.348724 (= 2√3991) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5964 × |
15964 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and sixty-four |
| Binary (base 2) | 11111001011100 |
| Octal (base 8) | 37134 |
| Hexadecimal (base 16) | 3E5C |
| Base 3 | 210220021 |
| As time | 15964 seconds = 4 h 26 min 4 s |
Is 15964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15964 ÷ 2 = 7982) | 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 | Yes (15964 ÷ 4 = 3991) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15964 a prime number?
No. 15964 = × 13 × 307, so it is divisible by 2.
What are the factors of 15964?
1, 2, 4, 13, 26, 52, 307, 614, 1228, 3991, 7982, 15964.
What is 15964 in binary?
11111001011100 (hexadecimal 3E5C, octal 37134).
What is the square root of 15964?
About 126.3487, exactly 2√3991.
Is 15964 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 15964?
It is a composite number with 12 divisors.