The number 53305
53305 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 1523. Divisors (8): 1, 5, 7, 35, 1523, 7615, 10661, 53305.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53305: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
53305 is composite. Its prime factorisation is
- 3
The divisors add up to 73152; without 53305 itself that is 19847, so 53305 is deficient (19847 is less than 53305). Euler's totient φ(53305) = 36528 numbers up to 53305 share no factor with it.
- 4
The digits of 53305 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53305 = 5 \times 7 \times 1523 \]
53305 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 73152 |
| Euler totient φ(n) | 36528 |
| Square | 2841423025 |
| Cube | 151462054347625 |
| Square root | 230.878756 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3305 × |
53305 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand three hundred and five |
| Binary (base 2) | 1101000000111001 |
| Octal (base 8) | 150071 |
| Hexadecimal (base 16) | D039 |
| Base 3 | 2201010021 |
| As time | 53305 seconds = 14 h 48 min 25 s |
Is 53305 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 (53305 ÷ 5 = 10661) | 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 | Yes (53305 ÷ 7 = 7615) | 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 7) | 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 10) | 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 53305 a prime number?
No. 53305 = 5 × 7 × 1523, so it is divisible by 5.
What are the factors of 53305?
1, 5, 7, 35, 1523, 7615, 10661, 53305.
What is 53305 in binary?
1101000000111001 (hexadecimal D039, octal 150071).
What is the square root of 53305?
About 230.8788.
Is 53305 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 53305?
53305 is a happy number: repeatedly adding the squares of its digits reaches 1.