The number 53035
53035 is a palindrome: it reads 53035 backwards too. Its prime factorisation is 5 × 10607. Divisors (4): 1, 5, 10607, 53035.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53035: a palindrome: it reads 53035 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10607, the product of two primes.
- 2
53035 is composite. Its prime factorisation is
- 3
The divisors add up to 63648; without 53035 itself that is 10613, so 53035 is deficient (10613 is less than 53035). Euler's totient φ(53035) = 42424 numbers up to 53035 share no factor with it.
- 4
The digits of 53035 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53035 = 5 \times 10607 \]
53035 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63648 |
| Euler totient φ(n) | 42424 |
| Square | 2812711225 |
| Cube | 149172139817875 |
| Square root | 230.293291 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3035 × |
53035 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and thirty-five |
| Binary (base 2) | 1100111100101011 |
| Octal (base 8) | 147453 |
| Hexadecimal (base 16) | CF2B |
| Base 3 | 2200202021 |
| As time | 53035 seconds = 14 h 43 min 55 s |
Is 53035 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 (53035 ÷ 5 = 10607) | 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 3) | 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 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 53035 a prime number?
No. 53035 = 5 × 10607, so it is divisible by 5.
What are the factors of 53035?
1, 5, 10607, 53035.
What is 53035 in binary?
1100111100101011 (hexadecimal CF2B, octal 147453).
What is the square root of 53035?
About 230.2933.
Is 53035 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53035?
53035 is a palindrome: it reads 53035 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10607, the product of two primes.