The number 59059
59059 is a composite number with 16 divisors. Its prime factorisation is 7 × 11 × 13 × 59. Divisors (16): 1, 7, 11, 13, 59, 77, 91, 143, 413, 649, 767, 1001, 4543, 5369, 8437, 59059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59059 is composite. Its prime factorisation is
- 3
The divisors add up to 80640; without 59059 itself that is 21581, so 59059 is deficient (21581 is less than 59059). Euler's totient φ(59059) = 41760 numbers up to 59059 share no factor with it.
- 4
The digits of 59059 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59059 = 7 \times 11 \times 13 \times 59 \]
59059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 80640 |
| Euler totient φ(n) | 41760 |
| Square | 3487965481 |
| Cube | 205995753342379 |
| Square root | 243.020575 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.9059 × |
59059 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and fifty-nine |
| Binary (base 2) | 1110011010110011 |
| Octal (base 8) | 163263 |
| Hexadecimal (base 16) | E6B3 |
| Base 3 | 10000000101 |
| As time | 59059 seconds = 16 h 24 min 19 s |
Is 59059 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 | Yes (59059 ÷ 7 = 8437) | 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 1) | 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 | Yes (59059 ÷ 11 = 5369) | 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 59059 a prime number?
No. 59059 = 7 × 11 × 13 × 59, so it is divisible by 7.
What are the factors of 59059?
1, 7, 11, 13, 59, 77, 91, 143, 413, 649, 767, 1001, 4543, 5369, 8437, 59059.
What is 59059 in binary?
1110011010110011 (hexadecimal E6B3, octal 163263).
What is the square root of 59059?
About 243.0206.
Is 59059 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 59059?
It is a composite number with 16 divisors.