The number 53015
53015 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 461. Divisors (8): 1, 5, 23, 115, 461, 2305, 10603, 53015.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53015 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53015 is composite. Its prime factorisation is
- 3
The divisors add up to 66528; without 53015 itself that is 13513, so 53015 is deficient (13513 is less than 53015). Euler's totient φ(53015) = 40480 numbers up to 53015 share no factor with it.
- 4
The digits of 53015 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53015 = 5 \times 23 \times 461 \]
53015 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66528 |
| Euler totient φ(n) | 40480 |
| Square | 2810590225 |
| Cube | 149003440778375 |
| Square root | 230.249864 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3015 × |
53015 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifteen |
| Binary (base 2) | 1100111100010111 |
| Octal (base 8) | 147427 |
| Hexadecimal (base 16) | CF17 |
| Base 3 | 2200201112 |
| As time | 53015 seconds = 14 h 43 min 35 s |
Is 53015 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 (53015 ÷ 5 = 10603) | 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 | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 6) | 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 53015 a prime number?
No. 53015 = 5 × 23 × 461, so it is divisible by 5.
What are the factors of 53015?
1, 5, 23, 115, 461, 2305, 10603, 53015.
What is 53015 in binary?
1100111100010111 (hexadecimal CF17, octal 147427).
What is the square root of 53015?
About 230.2499.
Is 53015 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 53015?
It is a composite number with 8 divisors.