The number 53435
53435 is a palindrome: it reads 53435 backwards too. Its prime factorisation is 5 × 10687. Divisors (4): 1, 5, 10687, 53435.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53435: a palindrome: it reads 53435 backwards too; a semiprime: 5 × 10687, the product of two primes.
- 2
53435 is composite. Its prime factorisation is
- 3
The divisors add up to 64128; without 53435 itself that is 10693, so 53435 is deficient (10693 is less than 53435). Euler's totient φ(53435) = 42744 numbers up to 53435 share no factor with it.
- 4
The digits of 53435 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53435 = 5 \times 10687 \]
53435 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64128 |
| Euler totient φ(n) | 42744 |
| Square | 2855299225 |
| Cube | 152572914087875 |
| Square root | 231.160118 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.3435 × |
53435 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and thirty-five |
| Binary (base 2) | 1101000010111011 |
| Octal (base 8) | 150273 |
| Hexadecimal (base 16) | D0BB |
| Base 3 | 2201022002 |
| As time | 53435 seconds = 14 h 50 min 35 s |
Is 53435 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 (53435 ÷ 5 = 10687) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53435 a prime number?
No. 53435 = 5 × 10687, so it is divisible by 5.
What are the factors of 53435?
1, 5, 10687, 53435.
What is 53435 in binary?
1101000010111011 (hexadecimal D0BB, octal 150273).
What is the square root of 53435?
About 231.1601.
Is 53435 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53435?
53435 is a palindrome: it reads 53435 backwards too; a semiprime: 5 × 10687, the product of two primes.