The number 53115
53115 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3541. Divisors (8): 1, 3, 5, 15, 3541, 10623, 17705, 53115.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53115: a Harshad number: divisible by its digit sum 15.
- 2
53115 is composite. Its prime factorisation is
- 3
The divisors add up to 85008; without 53115 itself that is 31893, so 53115 is deficient (31893 is less than 53115). Euler's totient φ(53115) = 28320 numbers up to 53115 share no factor with it.
- 4
The digits of 53115 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53115 = 3 \times 5 \times 3541 \]
53115 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 85008 |
| Euler totient φ(n) | 28320 |
| Square | 2821203225 |
| Cube | 149848209295875 |
| Square root | 230.466917 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3115 × |
53115 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and fifteen |
| Binary (base 2) | 1100111101111011 |
| Octal (base 8) | 147573 |
| Hexadecimal (base 16) | CF7B |
| Base 3 | 2200212020 |
| As time | 53115 seconds = 14 h 45 min 15 s |
Is 53115 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 (53115 ÷ 3 = 17705) | 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 (53115 ÷ 5 = 10623) | 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 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 6) | 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 7) | 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 53115 a prime number?
No. 53115 = 3 × 5 × 3541, so it is divisible by 3.
What are the factors of 53115?
1, 3, 5, 15, 3541, 10623, 17705, 53115.
What is 53115 in binary?
1100111101111011 (hexadecimal CF7B, octal 147573).
What is the square root of 53115?
About 230.4669.
Is 53115 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 53115?
53115 is a Harshad number: divisible by its digit sum 15.