The number 53215
53215 is a composite number with 8 divisors. Its prime factorisation is 5 × 29 × 367. Divisors (8): 1, 5, 29, 145, 367, 1835, 10643, 53215.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53215 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53215 is composite. Its prime factorisation is
- 3
The divisors add up to 66240; without 53215 itself that is 13025, so 53215 is deficient (13025 is less than 53215). Euler's totient φ(53215) = 40992 numbers up to 53215 share no factor with it.
- 4
The digits of 53215 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53215 = 5 \times 29 \times 367 \]
53215 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66240 |
| Euler totient φ(n) | 40992 |
| Square | 2831836225 |
| Cube | 150696164713375 |
| Square root | 230.683766 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.3215 × |
53215 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand two hundred and fifteen |
| Binary (base 2) | 1100111111011111 |
| Octal (base 8) | 147737 |
| Hexadecimal (base 16) | CFDF |
| Base 3 | 2200222221 |
| As time | 53215 seconds = 14 h 46 min 55 s |
Is 53215 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 (53215 ÷ 5 = 10643) | 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 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 7) | 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 8) | 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 53215 a prime number?
No. 53215 = 5 × 29 × 367, so it is divisible by 5.
What are the factors of 53215?
1, 5, 29, 145, 367, 1835, 10643, 53215.
What is 53215 in binary?
1100111111011111 (hexadecimal CFDF, octal 147737).
What is the square root of 53215?
About 230.6838.
Is 53215 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53215?
It is a composite number with 8 divisors.