The number 15128
15128 is a composite number with 16 divisors. Its prime factorisation is × 31 × 61. Divisors (16): 1, 2, 4, 8, 31, 61, 62, 122, 124, 244, 248, 488, 1891, 3782, 7564, 15128.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15128 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15128 is composite. Its prime factorisation is
- 3
The divisors add up to 29760; without 15128 itself that is 14632, so 15128 is deficient (14632 is less than 15128). Euler's totient φ(15128) = 7200 numbers up to 15128 share no factor with it.
- 4
The digits of 15128 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15128 = 2^{3} \times 31 \times 61 \]15128 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 29760 |
| Euler totient φ(n) | 7200 |
| Square | 228856384 |
| Cube | 3462139377152 |
| Square root | 122.995935 (= 2√3782) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5128 × |
15128 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and twenty-eight |
| Binary (base 2) | 11101100011000 |
| Octal (base 8) | 35430 |
| Hexadecimal (base 16) | 3B18 |
| Base 3 | 202202022 |
| As time | 15128 seconds = 4 h 12 min 8 s |
Is 15128 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15128 ÷ 2 = 7564) | 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 | Yes (15128 ÷ 4 = 3782) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (15128 ÷ 8 = 1891) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15128 a prime number?
No. 15128 = × 31 × 61, so it is divisible by 2.
What are the factors of 15128?
1, 2, 4, 8, 31, 61, 62, 122, 124, 244, 248, 488, 1891, 3782, 7564, 15128.
What is 15128 in binary?
11101100011000 (hexadecimal 3B18, octal 35430).
What is the square root of 15128?
About 122.9959, exactly 2√3782.
Is 15128 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15128?
It is a composite number with 16 divisors.