The number 53259
53259 is a binary palindrome (1101000000001011). Its prime factorisation is 3 × 41 × 433. Divisors (8): 1, 3, 41, 123, 433, 1299, 17753, 53259.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53259: a binary palindrome (1101000000001011).
- 2
53259 is composite. Its prime factorisation is
- 3
The divisors add up to 72912; without 53259 itself that is 19653, so 53259 is deficient (19653 is less than 53259). Euler's totient φ(53259) = 34560 numbers up to 53259 share no factor with it.
- 4
The digits of 53259 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53259 = 3 \times 41 \times 433 \]
53259 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72912 |
| Euler totient φ(n) | 34560 |
| Square | 2836521081 |
| Cube | 151070276252979 |
| Square root | 230.779115 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3259 × |
53259 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand two hundred and fifty-nine |
| Binary (base 2) | 1101000000001011 |
| Octal (base 8) | 150013 |
| Hexadecimal (base 16) | D00B |
| Base 3 | 2201001120 |
| As time | 53259 seconds = 14 h 47 min 39 s |
Is 53259 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 | Yes (53259 ÷ 3 = 17753) | 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 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53259 a prime number?
No. 53259 = 3 × 41 × 433, so it is divisible by 3.
What are the factors of 53259?
1, 3, 41, 123, 433, 1299, 17753, 53259.
What is 53259 in binary?
1101000000001011 (hexadecimal D00B, octal 150013).
What is the square root of 53259?
About 230.7791.
Is 53259 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 53259?
53259 is a binary palindrome (1101000000001011).