The number 59406
59406 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 9901. Divisors (8): 1, 2, 3, 6, 9901, 19802, 29703, 59406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59406 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59406 is composite. Its prime factorisation is
- 3
The divisors add up to 118824; without 59406 itself that is 59418, so 59406 is abundant (59418 is more than 59406). Euler's totient φ(59406) = 19800 numbers up to 59406 share no factor with it.
- 4
The digits of 59406 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59406 = 2 \times 3 \times 9901 \]
59406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 118824 |
| Euler totient φ(n) | 19800 |
| Square | 3529072836 |
| Cube | 209648100895416 |
| Square root | 243.733461 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.9406 × |
59406 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and six |
| Binary (base 2) | 1110100000001110 |
| Octal (base 8) | 164016 |
| Hexadecimal (base 16) | E80E |
| Base 3 | 10000111020 |
| As time | 59406 seconds = 16 h 30 min 6 s |
Is 59406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59406 ÷ 2 = 29703) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59406 ÷ 3 = 19802) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (59406 ÷ 6 = 9901) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59406 a prime number?
No. 59406 = 2 × 3 × 9901, so it is divisible by 2.
What are the factors of 59406?
1, 2, 3, 6, 9901, 19802, 29703, 59406.
What is 59406 in binary?
1110100000001110 (hexadecimal E80E, octal 164016).
What is the square root of 59406?
About 243.7335.
Is 59406 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 59406?
It is a composite number with 8 divisors.