The number 59013
59013 is a composite number with 12 divisors. Its prime factorisation is × 79 × 83. Divisors (12): 1, 3, 9, 79, 83, 237, 249, 711, 747, 6557, 19671, 59013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59013 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59013 is composite. Its prime factorisation is
- 3
The divisors add up to 87360; without 59013 itself that is 28347, so 59013 is deficient (28347 is less than 59013). Euler's totient φ(59013) = 38376 numbers up to 59013 share no factor with it.
- 4
The digits of 59013 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59013 = 3^{2} \times 79 \times 83 \]59013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 87360 |
| Euler totient φ(n) | 38376 |
| Square | 3482534169 |
| Cube | 205514788915197 |
| Square root | 242.925915 (= 3√6557) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9013 × |
59013 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and thirteen |
| Binary (base 2) | 1110011010000101 |
| Octal (base 8) | 163205 |
| Hexadecimal (base 16) | E685 |
| Base 3 | 2222221200 |
| As time | 59013 seconds = 16 h 23 min 33 s |
Is 59013 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 | Yes (59013 ÷ 3 = 19671) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (59013 ÷ 9 = 6557) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59013 a prime number?
No. 59013 = × 79 × 83, so it is divisible by 3.
What are the factors of 59013?
1, 3, 9, 79, 83, 237, 249, 711, 747, 6557, 19671, 59013.
What is 59013 in binary?
1110011010000101 (hexadecimal E685, octal 163205).
What is the square root of 59013?
About 242.9259, exactly 3√6557.
Is 59013 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 59013?
It is a composite number with 12 divisors.