The number 59000
59000 is a composite number with 32 divisors. Its prime factorisation is × × 59. Divisors (32): 1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 59, 100, 118, 125, 200, 236 … 59000.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59000 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59000 is composite. Its prime factorisation is
- 3
The divisors add up to 140400; without 59000 itself that is 81400, so 59000 is abundant (81400 is more than 59000). Euler's totient φ(59000) = 23200 numbers up to 59000 share no factor with it.
- 4
The digits of 59000 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59000 = 2^{3} \times 5^{3} \times 59 \]59000 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 140400 |
| Euler totient φ(n) | 23200 |
| Square | 3481000000 |
| Cube | 205379000000000 |
| Square root | 242.899156 (= 10√590) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.9 × |
59000 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand |
| Binary (base 2) | 1110011001111000 |
| Octal (base 8) | 163170 |
| Hexadecimal (base 16) | E678 |
| Base 3 | 2222221012 |
| As time | 59000 seconds = 16 h 23 min 20 s |
Is 59000 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59000 ÷ 2 = 29500) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (59000 ÷ 4 = 14750) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59000 ÷ 5 = 11800) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (59000 ÷ 8 = 7375) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59000 ÷ 10 = 5900) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59000 a prime number?
No. 59000 = × × 59, so it is divisible by 2.
What are the factors of 59000?
1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 59, 100, 118, 125, 200, 236, 250, 295, 472, 500, 590, 1000, 1180, 1475, 2360, 2950, 5900, 7375, 11800, 14750, 29500, 59000.
What is 59000 in binary?
1110011001111000 (hexadecimal E678, octal 163170).
What is the square root of 59000?
About 242.8992, exactly 10√590.
Is 59000 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 59000?
It is a composite number with 32 divisors.