The number 53065
53065 is a composite number with 4 divisors. Its prime factorisation is 5 × 10613. Divisors (4): 1, 5, 10613, 53065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53065: a semiprime: 5 × 10613, the product of two primes.
- 2
53065 is composite. Its prime factorisation is
- 3
The divisors add up to 63684; without 53065 itself that is 10619, so 53065 is deficient (10619 is less than 53065). Euler's totient φ(53065) = 42448 numbers up to 53065 share no factor with it.
- 4
The digits of 53065 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53065 = 5 \times 10613 \]
53065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63684 |
| Euler totient φ(n) | 42448 |
| Square | 2815894225 |
| Cube | 149425427049625 |
| Square root | 230.358416 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3065 × |
53065 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and sixty-five |
| Binary (base 2) | 1100111101001001 |
| Octal (base 8) | 147511 |
| Hexadecimal (base 16) | CF49 |
| Base 3 | 2200210101 |
| As time | 53065 seconds = 14 h 44 min 25 s |
Is 53065 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (53065 ÷ 5 = 10613) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53065 a prime number?
No. 53065 = 5 × 10613, so it is divisible by 5.
What are the factors of 53065?
1, 5, 10613, 53065.
What is 53065 in binary?
1100111101001001 (hexadecimal CF49, octal 147511).
What is the square root of 53065?
About 230.3584.
Is 53065 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 53065?
53065 is a semiprime: 5 × 10613, the product of two primes.