The number 53395
53395 is a composite number with 8 divisors. Its prime factorisation is 5 × 59 × 181. Divisors (8): 1, 5, 59, 181, 295, 905, 10679, 53395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53395 is composite. Its prime factorisation is
- 3
The divisors add up to 65520; without 53395 itself that is 12125, so 53395 is deficient (12125 is less than 53395). Euler's totient φ(53395) = 41760 numbers up to 53395 share no factor with it.
- 4
The digits of 53395 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 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53395 = 5 \times 59 \times 181 \]
53395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65520 |
| Euler totient φ(n) | 41760 |
| Square | 2851026025 |
| Cube | 152230534604875 |
| Square root | 231.073581 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.3395 × |
53395 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and ninety-five |
| Binary (base 2) | 1101000010010011 |
| Octal (base 8) | 150223 |
| Hexadecimal (base 16) | D093 |
| Base 3 | 2201020121 |
| As time | 53395 seconds = 14 h 49 min 55 s |
Is 53395 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 (53395 ÷ 5 = 10679) | 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 1) | 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 53395 a prime number?
No. 53395 = 5 × 59 × 181, so it is divisible by 5.
What are the factors of 53395?
1, 5, 59, 181, 295, 905, 10679, 53395.
What is 53395 in binary?
1101000010010011 (hexadecimal D093, octal 150223).
What is the square root of 53395?
About 231.0736.
Is 53395 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 53395?
It is a composite number with 8 divisors.