The number 15962
15962 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 347. Divisors (8): 1, 2, 23, 46, 347, 694, 7981, 15962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15962: a Harshad number: divisible by its digit sum 23.
- 2
15962 is composite. Its prime factorisation is
- 3
The divisors add up to 25056; without 15962 itself that is 9094, so 15962 is deficient (9094 is less than 15962). Euler's totient φ(15962) = 7612 numbers up to 15962 share no factor with it.
- 4
The digits of 15962 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15962 = 2 \times 23 \times 347 \]
15962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25056 |
| Euler totient φ(n) | 7612 |
| Square | 254785444 |
| Cube | 4066885257128 |
| Square root | 126.340809 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5962 × |
15962 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and sixty-two |
| Binary (base 2) | 11111001011010 |
| Octal (base 8) | 37132 |
| Hexadecimal (base 16) | 3E5A |
| Base 3 | 210220012 |
| As time | 15962 seconds = 4 h 26 min 2 s |
Is 15962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15962 ÷ 2 = 7981) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15962 a prime number?
No. 15962 = 2 × 23 × 347, so it is divisible by 2.
What are the factors of 15962?
1, 2, 23, 46, 347, 694, 7981, 15962.
What is 15962 in binary?
11111001011010 (hexadecimal 3E5A, octal 37132).
What is the square root of 15962?
About 126.3408.
Is 15962 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 15962?
15962 is a Harshad number: divisible by its digit sum 23.