The number 15951
15951 is a palindrome: it reads 15951 backwards too. Its prime factorisation is 3 × 13 × 409. Divisors (8): 1, 3, 13, 39, 409, 1227, 5317, 15951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15951: a palindrome: it reads 15951 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15951 is composite. Its prime factorisation is
- 3
The divisors add up to 22960; without 15951 itself that is 7009, so 15951 is deficient (7009 is less than 15951). Euler's totient φ(15951) = 9792 numbers up to 15951 share no factor with it.
- 4
The digits of 15951 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15951 = 3 \times 13 \times 409 \]
15951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 22960 |
| Euler totient φ(n) | 9792 |
| Square | 254434401 |
| Cube | 4058483130351 |
| Square root | 126.297268 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5951 × |
15951 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and fifty-one |
| Binary (base 2) | 11111001001111 |
| Octal (base 8) | 37117 |
| Hexadecimal (base 16) | 3E4F |
| Base 3 | 210212210 |
| As time | 15951 seconds = 4 h 25 min 51 s |
Is 15951 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 (15951 ÷ 3 = 5317) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15951 a prime number?
No. 15951 = 3 × 13 × 409, so it is divisible by 3.
What are the factors of 15951?
1, 3, 13, 39, 409, 1227, 5317, 15951.
What is 15951 in binary?
11111001001111 (hexadecimal 3E4F, octal 37117).
What is the square root of 15951?
About 126.2973.
Is 15951 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15951?
15951 is a palindrome: it reads 15951 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.