The number 15555
15555 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 17 × 61. Divisors (16): 1, 3, 5, 15, 17, 51, 61, 85, 183, 255, 305, 915, 1037, 3111, 5185, 15555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15555 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15555 is composite. Its prime factorisation is
- 3
The divisors add up to 26784; without 15555 itself that is 11229, so 15555 is deficient (11229 is less than 15555). Euler's totient φ(15555) = 7680 numbers up to 15555 share no factor with it.
- 4
The digits of 15555 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15555 = 3 \times 5 \times 17 \times 61 \]
15555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 26784 |
| Euler totient φ(n) | 7680 |
| Square | 241958025 |
| Cube | 3763657078875 |
| Square root | 124.719686 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5555 × |
15555 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and fifty-five |
| Binary (base 2) | 11110011000011 |
| Octal (base 8) | 36303 |
| Hexadecimal (base 16) | 3CC3 |
| Base 3 | 210100010 |
| As time | 15555 seconds = 4 h 19 min 15 s |
Is 15555 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 | Yes (15555 ÷ 3 = 5185) | 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 (15555 ÷ 5 = 3111) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15555 a prime number?
No. 15555 = 3 × 5 × 17 × 61, so it is divisible by 3.
What are the factors of 15555?
1, 3, 5, 15, 17, 51, 61, 85, 183, 255, 305, 915, 1037, 3111, 5185, 15555.
What is 15555 in binary?
11110011000011 (hexadecimal 3CC3, octal 36303).
What is the square root of 15555?
About 124.7197.
Is 15555 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15555?
It is a composite number with 16 divisors.