The number 15952
15952 is a composite number with 10 divisors. Its prime factorisation is × 997. Divisors (10): 1, 2, 4, 8, 16, 997, 1994, 3988, 7976, 15952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15952 is composite. Its prime factorisation is
- 3
The divisors add up to 30938; without 15952 itself that is 14986, so 15952 is deficient (14986 is less than 15952). Euler's totient φ(15952) = 7968 numbers up to 15952 share no factor with it.
- 4
The digits of 15952 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15952 = 2^{4} \times 997 \]15952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 30938 |
| Euler totient φ(n) | 7968 |
| Square | 254466304 |
| Cube | 4059246481408 |
| Square root | 126.301227 (= 4√997) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5952 × |
15952 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and fifty-two |
| Binary (base 2) | 11111001010000 |
| Octal (base 8) | 37120 |
| Hexadecimal (base 16) | 3E50 |
| Base 3 | 210212211 |
| As time | 15952 seconds = 4 h 25 min 52 s |
Is 15952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15952 ÷ 2 = 7976) | 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 | Yes (15952 ÷ 4 = 3988) | 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 6) | 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 | Yes (15952 ÷ 8 = 1994) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15952 a prime number?
No. 15952 = × 997, so it is divisible by 2.
What are the factors of 15952?
1, 2, 4, 8, 16, 997, 1994, 3988, 7976, 15952.
What is 15952 in binary?
11111001010000 (hexadecimal 3E50, octal 37120).
What is the square root of 15952?
About 126.3012, exactly 4√997.
Is 15952 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 15952?
It is a composite number with 10 divisors.