The number 59055
59055 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 31 × 127. Divisors (16): 1, 3, 5, 15, 31, 93, 127, 155, 381, 465, 635, 1905, 3937, 11811, 19685, 59055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59055 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59055 is composite. Its prime factorisation is
- 3
The divisors add up to 98304; without 59055 itself that is 39249, so 59055 is deficient (39249 is less than 59055). Euler's totient φ(59055) = 30240 numbers up to 59055 share no factor with it.
- 4
The digits of 59055 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 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59055 = 3 \times 5 \times 31 \times 127 \]
59055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 98304 |
| Euler totient φ(n) | 30240 |
| Square | 3487493025 |
| Cube | 205953900591375 |
| Square root | 243.012345 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9055 × |
59055 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and fifty-five |
| Binary (base 2) | 1110011010101111 |
| Octal (base 8) | 163257 |
| Hexadecimal (base 16) | E6AF |
| Base 3 | 10000000020 |
| As time | 59055 seconds = 16 h 24 min 15 s |
Is 59055 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 (59055 ÷ 3 = 19685) | 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 | Yes (59055 ÷ 5 = 11811) | 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 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59055 a prime number?
No. 59055 = 3 × 5 × 31 × 127, so it is divisible by 3.
What are the factors of 59055?
1, 3, 5, 15, 31, 93, 127, 155, 381, 465, 635, 1905, 3937, 11811, 19685, 59055.
What is 59055 in binary?
1110011010101111 (hexadecimal E6AF, octal 163257).
What is the square root of 59055?
About 243.0123.
Is 59055 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 59055?
It is a composite number with 16 divisors.