The number 15159
15159 is a binary palindrome (11101100110111). Its prime factorisation is 3 × 31 × 163. Divisors (8): 1, 3, 31, 93, 163, 489, 5053, 15159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15159: a binary palindrome (11101100110111); a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
15159 is composite. Its prime factorisation is
- 3
The divisors add up to 20992; without 15159 itself that is 5833, so 15159 is deficient (5833 is less than 15159). Euler's totient φ(15159) = 9720 numbers up to 15159 share no factor with it.
- 4
The digits of 15159 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15159 = 3 \times 31 \times 163 \]
15159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20992 |
| Euler totient φ(n) | 9720 |
| Square | 229795281 |
| Cube | 3483466664679 |
| Square root | 123.121891 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5159 × |
15159 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and fifty-nine |
| Binary (base 2) | 11101100110111 |
| Octal (base 8) | 35467 |
| Hexadecimal (base 16) | 3B37 |
| Base 3 | 202210110 |
| As time | 15159 seconds = 4 h 12 min 39 s |
Is 15159 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 (15159 ÷ 3 = 5053) | 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 4) | 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 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 9) | 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 15159 a prime number?
No. 15159 = 3 × 31 × 163, so it is divisible by 3.
What are the factors of 15159?
1, 3, 31, 93, 163, 489, 5053, 15159.
What is 15159 in binary?
11101100110111 (hexadecimal 3B37, octal 35467).
What is the square root of 15159?
About 123.1219.
Is 15159 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15159?
15159 is a binary palindrome (11101100110111); a happy number: repeatedly adding the squares of its digits reaches 1.