The number 15851
15851 is a palindrome: it reads 15851 backwards too. Its prime factorisation is Ć 131. Divisors (6): 1, 11, 121, 131, 1441, 15851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15851: a palindrome: it reads 15851 backwards too.
- 2
15851 is composite. Its prime factorisation is
- 3
The divisors add up to 17556; without 15851 itself that is 1705, so 15851 is deficient (1705 is less than 15851). Euler's totient Ļ(15851) = 14300 numbers up to 15851 share no factor with it.
- 4
The digits of 15851 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15851 = 11^{2} \times 131 \]15851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 17556 |
| Euler totient Ļ(n) | 14300 |
| Square | 251254201 |
| Cube | 3982630340051 |
| Square root | 125.900755 (= 11ā131) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.5851 Ć |
15851 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand eight hundred and fifty-one |
| Binary (base 2) | 11110111101011 |
| Octal (base 8) | 36753 |
| Hexadecimal (base 16) | 3DEB |
| Base 3 | 210202002 |
| As time | 15851 seconds = 4 h 24 min 11 s |
Is 15851 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | Yes (15851 Ć· 11 = 1441) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15851 a prime number?
No. 15851 = Ć 131, so it is divisible by 11.
What are the factors of 15851?
1, 11, 121, 131, 1441, 15851.
What is 15851 in binary?
11110111101011 (hexadecimal 3DEB, octal 36753).
What is the square root of 15851?
About 125.9008, exactly 11ā131.
Is 15851 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15851?
15851 is a palindrome: it reads 15851 backwards too.