The number 55915
55915 is a composite number with 8 divisors. Its prime factorisation is 5 × 53 × 211. Divisors (8): 1, 5, 53, 211, 265, 1055, 11183, 55915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55915 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55915 is composite. Its prime factorisation is
- 3
The divisors add up to 68688; without 55915 itself that is 12773, so 55915 is deficient (12773 is less than 55915). Euler's totient φ(55915) = 43680 numbers up to 55915 share no factor with it.
- 4
The digits of 55915 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55915 = 5 \times 53 \times 211 \]
55915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68688 |
| Euler totient φ(n) | 43680 |
| Square | 3126487225 |
| Cube | 174817533185875 |
| Square root | 236.463528 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5915 × |
55915 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and fifteen |
| Binary (base 2) | 1101101001101011 |
| Octal (base 8) | 155153 |
| Hexadecimal (base 16) | DA6B |
| Base 3 | 2211200221 |
| As time | 55915 seconds = 15 h 31 min 55 s |
Is 55915 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 (55915 ÷ 5 = 11183) | 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 6) | 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 7) | 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 2) | 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 55915 a prime number?
No. 55915 = 5 × 53 × 211, so it is divisible by 5.
What are the factors of 55915?
1, 5, 53, 211, 265, 1055, 11183, 55915.
What is 55915 in binary?
1101101001101011 (hexadecimal DA6B, octal 155153).
What is the square root of 55915?
About 236.4635.
Is 55915 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 55915?
It is a composite number with 8 divisors.