The number 59081
59081 is a composite number with 8 divisors. Its prime factorisation is 11 × 41 × 131. Divisors (8): 1, 11, 41, 131, 451, 1441, 5371, 59081.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59081 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59081 is composite. Its prime factorisation is
- 3
The divisors add up to 66528; without 59081 itself that is 7447, so 59081 is deficient (7447 is less than 59081). Euler's totient φ(59081) = 52000 numbers up to 59081 share no factor with it.
- 4
The digits of 59081 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59081 = 11 \times 41 \times 131 \]
59081 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66528 |
| Euler totient φ(n) | 52000 |
| Square | 3490564561 |
| Cube | 206226044828441 |
| Square root | 243.065835 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9081 × |
59081 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and eighty-one |
| Binary (base 2) | 1110011011001001 |
| Octal (base 8) | 163311 |
| Hexadecimal (base 16) | E6C9 |
| Base 3 | 10000001012 |
| As time | 59081 seconds = 16 h 24 min 41 s |
Is 59081 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 1) | 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 1) | 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 5) | 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 | Yes (59081 ÷ 11 = 5371) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59081 a prime number?
No. 59081 = 11 × 41 × 131, so it is divisible by 11.
What are the factors of 59081?
1, 11, 41, 131, 451, 1441, 5371, 59081.
What is 59081 in binary?
1110011011001001 (hexadecimal E6C9, octal 163311).
What is the square root of 59081?
About 243.0658.
Is 59081 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 59081?
It is a composite number with 8 divisors.