The number 59111
59111 is a composite number with 4 divisors. Its prime factorisation is 13 × 4547. Divisors (4): 1, 13, 4547, 59111.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59111: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 4547, the product of two primes.
- 2
59111 is composite. Its prime factorisation is
- 3
The divisors add up to 63672; without 59111 itself that is 4561, so 59111 is deficient (4561 is less than 59111). Euler's totient φ(59111) = 54552 numbers up to 59111 share no factor with it.
- 4
The digits of 59111 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 241 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59111 = 13 \times 4547 \]
59111 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 63672 |
| Euler totient φ(n) | 54552 |
| Square | 3494110321 |
| Cube | 206540355184631 |
| Square root | 243.127539 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 241 |
| Scientific notation | 5.9111 × |
59111 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and eleven |
| Binary (base 2) | 1110011011100111 |
| Octal (base 8) | 163347 |
| Hexadecimal (base 16) | E6E7 |
| Base 3 | 10000002022 |
| As time | 59111 seconds = 16 h 25 min 11 s |
Is 59111 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59111 a prime number?
No. 59111 = 13 × 4547, so it is divisible by 13.
What are the factors of 59111?
1, 13, 4547, 59111.
What is 59111 in binary?
1110011011100111 (hexadecimal E6E7, octal 163347).
What is the square root of 59111?
About 243.1275.
Is 59111 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 59111?
59111 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 4547, the product of two primes.