The number 15981
15981 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 761. Divisors (8): 1, 3, 7, 21, 761, 2283, 5327, 15981.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15981 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15981 is composite. Its prime factorisation is
- 3
The divisors add up to 24384; without 15981 itself that is 8403, so 15981 is deficient (8403 is less than 15981). Euler's totient φ(15981) = 9120 numbers up to 15981 share no factor with it.
- 4
The digits of 15981 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15981 = 3 \times 7 \times 761 \]
15981 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24384 |
| Euler totient φ(n) | 9120 |
| Square | 255392361 |
| Cube | 4081425321141 |
| Square root | 126.415980 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5981 × |
15981 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and eighty-one |
| Binary (base 2) | 11111001101101 |
| Octal (base 8) | 37155 |
| Hexadecimal (base 16) | 3E6D |
| Base 3 | 210220220 |
| As time | 15981 seconds = 4 h 26 min 21 s |
Is 15981 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 (15981 ÷ 3 = 5327) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15981 ÷ 7 = 2283) | 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 6) | 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 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15981 a prime number?
No. 15981 = 3 × 7 × 761, so it is divisible by 3.
What are the factors of 15981?
1, 3, 7, 21, 761, 2283, 5327, 15981.
What is 15981 in binary?
11111001101101 (hexadecimal 3E6D, octal 37155).
What is the square root of 15981?
About 126.4160.
Is 15981 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 15981?
It is a composite number with 8 divisors.