The number 53261
53261 is a composite number with 8 divisors. Its prime factorisation is 13 × 17 × 241. Divisors (8): 1, 13, 17, 221, 241, 3133, 4097, 53261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53261: a Harshad number: divisible by its digit sum 17.
- 2
53261 is composite. Its prime factorisation is
- 3
The divisors add up to 60984; without 53261 itself that is 7723, so 53261 is deficient (7723 is less than 53261). Euler's totient φ(53261) = 46080 numbers up to 53261 share no factor with it.
- 4
The digits of 53261 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53261 = 13 \times 17 \times 241 \]
53261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 60984 |
| Euler totient φ(n) | 46080 |
| Square | 2836734121 |
| Cube | 151087296018581 |
| Square root | 230.783448 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.3261 × |
53261 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand two hundred and sixty-one |
| Binary (base 2) | 1101000000001101 |
| Octal (base 8) | 150015 |
| Hexadecimal (base 16) | D00D |
| Base 3 | 2201001122 |
| As time | 53261 seconds = 14 h 47 min 41 s |
Is 53261 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53261 a prime number?
No. 53261 = 13 × 17 × 241, so it is divisible by 13.
What are the factors of 53261?
1, 13, 17, 221, 241, 3133, 4097, 53261.
What is 53261 in binary?
1101000000001101 (hexadecimal D00D, octal 150015).
What is the square root of 53261?
About 230.7834.
Is 53261 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 53261?
53261 is a Harshad number: divisible by its digit sum 17.