The number 15961
15961 is a composite number with 4 divisors. Its prime factorisation is 11 × 1451. Divisors (4): 1, 11, 1451, 15961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15961: a semiprime: 11 × 1451, the product of two primes.
- 2
15961 is composite. Its prime factorisation is
- 3
The divisors add up to 17424; without 15961 itself that is 1463, so 15961 is deficient (1463 is less than 15961). Euler's totient φ(15961) = 14500 numbers up to 15961 share no factor with it.
- 4
The digits of 15961 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15961 = 11 \times 1451 \]
15961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17424 |
| Euler totient φ(n) | 14500 |
| Square | 254753521 |
| Cube | 4066120948681 |
| Square root | 126.336851 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.5961 × |
15961 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and sixty-one |
| Binary (base 2) | 11111001011001 |
| Octal (base 8) | 37131 |
| Hexadecimal (base 16) | 3E59 |
| Base 3 | 210220011 |
| As time | 15961 seconds = 4 h 26 min 1 s |
Is 15961 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15961 ÷ 11 = 1451) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15961 a prime number?
No. 15961 = 11 × 1451, so it is divisible by 11.
What are the factors of 15961?
1, 11, 1451, 15961.
What is 15961 in binary?
11111001011001 (hexadecimal 3E59, octal 37131).
What is the square root of 15961?
About 126.3369.
Is 15961 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 15961?
15961 is a semiprime: 11 × 1451, the product of two primes.