The number 59065
59065 is a composite number with 4 divisors. Its prime factorisation is 5 × 11813. Divisors (4): 1, 5, 11813, 59065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59065: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11813, the product of two primes.
- 2
59065 is composite. Its prime factorisation is
- 3
The divisors add up to 70884; without 59065 itself that is 11819, so 59065 is deficient (11819 is less than 59065). Euler's totient φ(59065) = 47248 numbers up to 59065 share no factor with it.
- 4
The digits of 59065 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59065 = 5 \times 11813 \]
59065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70884 |
| Euler totient φ(n) | 47248 |
| Square | 3488674225 |
| Cube | 206058543099625 |
| Square root | 243.032920 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.9065 × |
59065 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and sixty-five |
| Binary (base 2) | 1110011010111001 |
| Octal (base 8) | 163271 |
| Hexadecimal (base 16) | E6B9 |
| Base 3 | 10000000121 |
| As time | 59065 seconds = 16 h 24 min 25 s |
Is 59065 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 (59065 ÷ 5 = 11813) | 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 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 6) | 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 59065 a prime number?
No. 59065 = 5 × 11813, so it is divisible by 5.
What are the factors of 59065?
1, 5, 11813, 59065.
What is 59065 in binary?
1110011010111001 (hexadecimal E6B9, octal 163271).
What is the square root of 59065?
About 243.0329.
Is 59065 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 59065?
59065 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 11813, the product of two primes.