The number 15982
15982 is a composite number with 8 divisors. Its prime factorisation is 2 × 61 × 131. Divisors (8): 1, 2, 61, 122, 131, 262, 7991, 15982.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15982 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15982 is composite. Its prime factorisation is
- 3
The divisors add up to 24552; without 15982 itself that is 8570, so 15982 is deficient (8570 is less than 15982). Euler's totient φ(15982) = 7800 numbers up to 15982 share no factor with it.
- 4
The digits of 15982 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15982 = 2 \times 61 \times 131 \]
15982 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 24552 |
| Euler totient φ(n) | 7800 |
| Square | 255424324 |
| Cube | 4082191546168 |
| Square root | 126.419935 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5982 × |
15982 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and eighty-two |
| Binary (base 2) | 11111001101110 |
| Octal (base 8) | 37156 |
| Hexadecimal (base 16) | 3E6E |
| Base 3 | 210220221 |
| As time | 15982 seconds = 4 h 26 min 22 s |
Is 15982 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15982 ÷ 2 = 7991) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15982 a prime number?
No. 15982 = 2 × 61 × 131, so it is divisible by 2.
What are the factors of 15982?
1, 2, 61, 122, 131, 262, 7991, 15982.
What is 15982 in binary?
11111001101110 (hexadecimal 3E6E, octal 37156).
What is the square root of 15982?
About 126.4199.
Is 15982 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 15982?
It is a composite number with 8 divisors.