The number 15355
15355 is a composite number with 8 divisors. Its prime factorisation is 5 × 37 × 83. Divisors (8): 1, 5, 37, 83, 185, 415, 3071, 15355.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15355 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15355 is composite. Its prime factorisation is
- 3
The divisors add up to 19152; without 15355 itself that is 3797, so 15355 is deficient (3797 is less than 15355). Euler's totient φ(15355) = 11808 numbers up to 15355 share no factor with it.
- 4
The digits of 15355 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15355 = 5 \times 37 \times 83 \]
15355 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19152 |
| Euler totient φ(n) | 11808 |
| Square | 235776025 |
| Cube | 3620340863875 |
| Square root | 123.915294 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5355 × |
15355 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and fifty-five |
| Binary (base 2) | 11101111111011 |
| Octal (base 8) | 35773 |
| Hexadecimal (base 16) | 3BFB |
| Base 3 | 210001201 |
| As time | 15355 seconds = 4 h 15 min 55 s |
Is 15355 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 1) | 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 (15355 ÷ 5 = 3071) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15355 a prime number?
No. 15355 = 5 × 37 × 83, so it is divisible by 5.
What are the factors of 15355?
1, 5, 37, 83, 185, 415, 3071, 15355.
What is 15355 in binary?
11101111111011 (hexadecimal 3BFB, octal 35773).
What is the square root of 15355?
About 123.9153.
Is 15355 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15355?
It is a composite number with 8 divisors.