The number 15136
15136 is a composite number with 24 divisors. Its prime factorisation is × 11 × 43. Divisors (24): 1, 2, 4, 8, 11, 16, 22, 32, 43, 44, 86, 88, 172, 176, 344, 352 … 15136.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15136: a Harshad number: divisible by its digit sum 16.
- 2
15136 is composite. Its prime factorisation is
- 3
The divisors add up to 33264; without 15136 itself that is 18128, so 15136 is abundant (18128 is more than 15136). Euler's totient φ(15136) = 6720 numbers up to 15136 share no factor with it.
- 4
The digits of 15136 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15136 = 2^{5} \times 11 \times 43 \]15136 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 33264 |
| Euler totient φ(n) | 6720 |
| Square | 229098496 |
| Cube | 3467634835456 |
| Square root | 123.028452 (= 4√946) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5136 × |
15136 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and thirty-six |
| Binary (base 2) | 11101100100000 |
| Octal (base 8) | 35440 |
| Hexadecimal (base 16) | 3B20 |
| Base 3 | 202202121 |
| As time | 15136 seconds = 4 h 12 min 16 s |
Is 15136 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15136 ÷ 2 = 7568) | 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 (15136 ÷ 4 = 3784) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 (15136 ÷ 8 = 1892) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15136 ÷ 11 = 1376) | 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 15136 a prime number?
No. 15136 = × 11 × 43, so it is divisible by 2.
What are the factors of 15136?
1, 2, 4, 8, 11, 16, 22, 32, 43, 44, 86, 88, 172, 176, 344, 352, 473, 688, 946, 1376, 1892, 3784, 7568, 15136.
What is 15136 in binary?
11101100100000 (hexadecimal 3B20, octal 35440).
What is the square root of 15136?
About 123.0285, exactly 4√946.
Is 15136 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15136?
15136 is a Harshad number: divisible by its digit sum 16.