The number 53059
53059 is a composite number with 4 divisors. Its prime factorisation is 97 × 547. Divisors (4): 1, 97, 547, 53059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53059: a semiprime: 97 × 547, the product of two primes.
- 2
53059 is composite. Its prime factorisation is
- 3
The divisors add up to 53704; without 53059 itself that is 645, so 53059 is deficient (645 is less than 53059). Euler's totient φ(53059) = 52416 numbers up to 53059 share no factor with it.
- 4
The digits of 53059 add up to 22, 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
\[ 53059 = 97 \times 547 \]
53059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53704 |
| Euler totient φ(n) | 52416 |
| Square | 2815257481 |
| Cube | 149374746684379 |
| Square root | 230.345393 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3059 × |
53059 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand and fifty-nine |
| Binary (base 2) | 1100111101000011 |
| Octal (base 8) | 147503 |
| Hexadecimal (base 16) | CF43 |
| Base 3 | 2200210011 |
| As time | 53059 seconds = 14 h 44 min 19 s |
Is 53059 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 6) | 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 3) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53059 a prime number?
No. 53059 = 97 × 547, so it is divisible by 97.
What are the factors of 53059?
1, 97, 547, 53059.
What is 53059 in binary?
1100111101000011 (hexadecimal CF43, octal 147503).
What is the square root of 53059?
About 230.3454.
Is 53059 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 53059?
53059 is a semiprime: 97 × 547, the product of two primes.