The number 53695
53695 is a composite number with 4 divisors. Its prime factorisation is 5 × 10739. Divisors (4): 1, 5, 10739, 53695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53695: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10739, the product of two primes.
- 2
53695 is composite. Its prime factorisation is
- 3
The divisors add up to 64440; without 53695 itself that is 10745, so 53695 is deficient (10745 is less than 53695). Euler's totient φ(53695) = 42952 numbers up to 53695 share no factor with it.
- 4
The digits of 53695 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53695 = 5 \times 10739 \]
53695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64440 |
| Euler totient φ(n) | 42952 |
| Square | 2883153025 |
| Cube | 154810901677375 |
| Square root | 231.721816 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.3695 × |
53695 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand six hundred and ninety-five |
| Binary (base 2) | 1101000110111111 |
| Octal (base 8) | 150677 |
| Hexadecimal (base 16) | D1BF |
| Base 3 | 2201122201 |
| As time | 53695 seconds = 14 h 54 min 55 s |
Is 53695 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 (53695 ÷ 5 = 10739) | 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 5) | 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 1) | 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 4) | 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 53695 a prime number?
No. 53695 = 5 × 10739, so it is divisible by 5.
What are the factors of 53695?
1, 5, 10739, 53695.
What is 53695 in binary?
1101000110111111 (hexadecimal D1BF, octal 150677).
What is the square root of 53695?
About 231.7218.
Is 53695 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 53695?
53695 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10739, the product of two primes.