The number 59481
59481 is a composite number with 8 divisors. Its prime factorisation is × 2203. Divisors (8): 1, 3, 9, 27, 2203, 6609, 19827, 59481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59481: a Harshad number: divisible by its digit sum 27.
- 2
59481 is composite. Its prime factorisation is
- 3
The divisors add up to 88160; without 59481 itself that is 28679, so 59481 is deficient (28679 is less than 59481). Euler's totient φ(59481) = 39636 numbers up to 59481 share no factor with it.
- 4
The digits of 59481 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59481 = 3^{3} \times 2203 \]59481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88160 |
| Euler totient φ(n) | 39636 |
| Square | 3537989361 |
| Cube | 210443145181641 |
| Square root | 243.887269 (= 3√6609) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9481 × |
59481 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and eighty-one |
| Binary (base 2) | 1110100001011001 |
| Octal (base 8) | 164131 |
| Hexadecimal (base 16) | E859 |
| Base 3 | 10000121000 |
| As time | 59481 seconds = 16 h 31 min 21 s |
Is 59481 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 (59481 ÷ 3 = 19827) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (59481 ÷ 9 = 6609) | 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 4) | 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 59481 a prime number?
No. 59481 = × 2203, so it is divisible by 3.
What are the factors of 59481?
1, 3, 9, 27, 2203, 6609, 19827, 59481.
What is 59481 in binary?
1110100001011001 (hexadecimal E859, octal 164131).
What is the square root of 59481?
About 243.8873, exactly 3√6609.
Is 59481 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 59481?
59481 is a Harshad number: divisible by its digit sum 27.