The number 15155
15155 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 433. Divisors (8): 1, 5, 7, 35, 433, 2165, 3031, 15155.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15155 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15155 is composite. Its prime factorisation is
- 3
The divisors add up to 20832; without 15155 itself that is 5677, so 15155 is deficient (5677 is less than 15155). Euler's totient φ(15155) = 10368 numbers up to 15155 share no factor with it.
- 4
The digits of 15155 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15155 = 5 \times 7 \times 433 \]
15155 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20832 |
| Euler totient φ(n) | 10368 |
| Square | 229674025 |
| Cube | 3480709848875 |
| Square root | 123.105646 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5155 × |
15155 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and fifty-five |
| Binary (base 2) | 11101100110011 |
| Octal (base 8) | 35463 |
| Hexadecimal (base 16) | 3B33 |
| Base 3 | 202210022 |
| As time | 15155 seconds = 4 h 12 min 35 s |
Is 15155 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 | No (remainder 2) | 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 | Yes (15155 ÷ 5 = 3031) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15155 ÷ 7 = 2165) | 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 3) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15155 a prime number?
No. 15155 = 5 × 7 × 433, so it is divisible by 5.
What are the factors of 15155?
1, 5, 7, 35, 433, 2165, 3031, 15155.
What is 15155 in binary?
11101100110011 (hexadecimal 3B33, octal 35463).
What is the square root of 15155?
About 123.1056.
Is 15155 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15155?
It is a composite number with 8 divisors.