The number 15965
15965 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 103. Divisors (8): 1, 5, 31, 103, 155, 515, 3193, 15965.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15965 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15965 is composite. Its prime factorisation is
- 3
The divisors add up to 19968; without 15965 itself that is 4003, so 15965 is deficient (4003 is less than 15965). Euler's totient φ(15965) = 12240 numbers up to 15965 share no factor with it.
- 4
The digits of 15965 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15965 = 5 \times 31 \times 103 \]
15965 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19968 |
| Euler totient φ(n) | 12240 |
| Square | 254881225 |
| Cube | 4069178757125 |
| Square root | 126.352681 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5965 × |
15965 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and sixty-five |
| Binary (base 2) | 11111001011101 |
| Octal (base 8) | 37135 |
| Hexadecimal (base 16) | 3E5D |
| Base 3 | 210220022 |
| As time | 15965 seconds = 4 h 26 min 5 s |
Is 15965 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15965 ÷ 5 = 3193) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15965 a prime number?
No. 15965 = 5 × 31 × 103, so it is divisible by 5.
What are the factors of 15965?
1, 5, 31, 103, 155, 515, 3193, 15965.
What is 15965 in binary?
11111001011101 (hexadecimal 3E5D, octal 37135).
What is the square root of 15965?
About 126.3527.
Is 15965 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 15965?
It is a composite number with 8 divisors.