The number 53061
53061 is a composite number with 8 divisors. Its prime factorisation is 3 × 23 × 769. Divisors (8): 1, 3, 23, 69, 769, 2307, 17687, 53061.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
53061 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
53061 is composite. Its prime factorisation is
- 3
The divisors add up to 73920; without 53061 itself that is 20859, so 53061 is deficient (20859 is less than 53061). Euler's totient φ(53061) = 33792 numbers up to 53061 share no factor with it.
- 4
The digits of 53061 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53061 = 3 \times 23 \times 769 \]
53061 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 73920 |
| Euler totient φ(n) | 33792 |
| Square | 2815469721 |
| Cube | 149391638865981 |
| Square root | 230.349734 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3061 × |
53061 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and sixty-one |
| Binary (base 2) | 1100111101000101 |
| Octal (base 8) | 147505 |
| Hexadecimal (base 16) | CF45 |
| Base 3 | 2200210020 |
| As time | 53061 seconds = 14 h 44 min 21 s |
Is 53061 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 (53061 ÷ 3 = 17687) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53061 a prime number?
No. 53061 = 3 × 23 × 769, so it is divisible by 3.
What are the factors of 53061?
1, 3, 23, 69, 769, 2307, 17687, 53061.
What is 53061 in binary?
1100111101000101 (hexadecimal CF45, octal 147505).
What is the square root of 53061?
About 230.3497.
Is 53061 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 53061?
It is a composite number with 8 divisors.