The number 15957
15957 is a composite number with 10 divisors. Its prime factorisation is × 197. Divisors (10): 1, 3, 9, 27, 81, 197, 591, 1773, 5319, 15957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15957: a Harshad number: divisible by its digit sum 27.
- 2
15957 is composite. Its prime factorisation is
- 3
The divisors add up to 23958; without 15957 itself that is 8001, so 15957 is deficient (8001 is less than 15957). Euler's totient φ(15957) = 10584 numbers up to 15957 share no factor with it.
- 4
The digits of 15957 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15957 = 3^{4} \times 197 \]15957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 23958 |
| Euler totient φ(n) | 10584 |
| Square | 254625849 |
| Cube | 4063064672493 |
| Square root | 126.321020 (= 9√197) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5957 × |
15957 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and fifty-seven |
| Binary (base 2) | 11111001010101 |
| Octal (base 8) | 37125 |
| Hexadecimal (base 16) | 3E55 |
| Base 3 | 210220000 |
| As time | 15957 seconds = 4 h 25 min 57 s |
Is 15957 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 (15957 ÷ 3 = 5319) | 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 2) | 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 | No (remainder 4) | 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 | Yes (15957 ÷ 9 = 1773) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 15957 a prime number?
No. 15957 = × 197, so it is divisible by 3.
What are the factors of 15957?
1, 3, 9, 27, 81, 197, 591, 1773, 5319, 15957.
What is 15957 in binary?
11111001010101 (hexadecimal 3E55, octal 37125).
What is the square root of 15957?
About 126.3210, exactly 9√197.
Is 15957 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 15957?
15957 is a Harshad number: divisible by its digit sum 27.