The number 53005
53005 is a composite number with 4 divisors. Its prime factorisation is 5 × 10601. Divisors (4): 1, 5, 10601, 53005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53005: a semiprime: 5 × 10601, the product of two primes.
- 2
53005 is composite. Its prime factorisation is
- 3
The divisors add up to 63612; without 53005 itself that is 10607, so 53005 is deficient (10607 is less than 53005). Euler's totient φ(53005) = 42400 numbers up to 53005 share no factor with it.
- 4
The digits of 53005 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53005 = 5 \times 10601 \]
53005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63612 |
| Euler totient φ(n) | 42400 |
| Square | 2809530025 |
| Cube | 148919138975125 |
| Square root | 230.228148 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3005 × |
53005 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and five |
| Binary (base 2) | 1100111100001101 |
| Octal (base 8) | 147415 |
| Hexadecimal (base 16) | CF0D |
| Base 3 | 2200201011 |
| As time | 53005 seconds = 14 h 43 min 25 s |
Is 53005 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 (53005 ÷ 5 = 10601) | 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 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 4) | 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 7) | 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 53005 a prime number?
No. 53005 = 5 × 10601, so it is divisible by 5.
What are the factors of 53005?
1, 5, 10601, 53005.
What is 53005 in binary?
1100111100001101 (hexadecimal CF0D, octal 147415).
What is the square root of 53005?
About 230.2281.
Is 53005 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 53005?
53005 is a semiprime: 5 × 10601, the product of two primes.