The number 15158
15158 is a composite number with 16 divisors. Its prime factorisation is 2 × 11 × 13 × 53. Divisors (16): 1, 2, 11, 13, 22, 26, 53, 106, 143, 286, 583, 689, 1166, 1378, 7579, 15158.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15158 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15158 is composite. Its prime factorisation is
- 3
The divisors add up to 27216; without 15158 itself that is 12058, so 15158 is deficient (12058 is less than 15158). Euler's totient φ(15158) = 6240 numbers up to 15158 share no factor with it.
- 4
The digits of 15158 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15158 = 2 \times 11 \times 13 \times 53 \]
15158 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27216 |
| Euler totient φ(n) | 6240 |
| Square | 229764964 |
| Cube | 3482777324312 |
| Square root | 123.117830 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5158 × |
15158 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and fifty-eight |
| Binary (base 2) | 11101100110110 |
| Octal (base 8) | 35466 |
| Hexadecimal (base 16) | 3B36 |
| Base 3 | 202210102 |
| As time | 15158 seconds = 4 h 12 min 38 s |
Is 15158 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15158 ÷ 2 = 7579) | 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 2) | 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 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15158 ÷ 11 = 1378) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15158 a prime number?
No. 15158 = 2 × 11 × 13 × 53, so it is divisible by 2.
What are the factors of 15158?
1, 2, 11, 13, 22, 26, 53, 106, 143, 286, 583, 689, 1166, 1378, 7579, 15158.
What is 15158 in binary?
11101100110110 (hexadecimal 3B36, octal 35466).
What is the square root of 15158?
About 123.1178.
Is 15158 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15158?
It is a composite number with 16 divisors.