The number 59022
59022 is a composite number with 16 divisors. Its prime factorisation is 2 × × 1093. Divisors (16): 1, 2, 3, 6, 9, 18, 27, 54, 1093, 2186, 3279, 6558, 9837, 19674, 29511, 59022.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59022: a Harshad number: divisible by its digit sum 18.
- 2
59022 is composite. Its prime factorisation is
- 3
The divisors add up to 131280; without 59022 itself that is 72258, so 59022 is abundant (72258 is more than 59022). Euler's totient φ(59022) = 19656 numbers up to 59022 share no factor with it.
- 4
The digits of 59022 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59022 = 2 \times 3^{3} \times 1093 \]59022 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 131280 |
| Euler totient φ(n) | 19656 |
| Square | 3483596484 |
| Cube | 205608831678648 |
| Square root | 242.944438 (= 3√6558) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.9022 × |
59022 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and twenty-two |
| Binary (base 2) | 1110011010001110 |
| Octal (base 8) | 163216 |
| Hexadecimal (base 16) | E68E |
| Base 3 | 2222222000 |
| As time | 59022 seconds = 16 h 23 min 42 s |
Is 59022 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59022 ÷ 2 = 29511) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59022 ÷ 3 = 19674) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (59022 ÷ 6 = 9837) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (59022 ÷ 9 = 6558) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59022 a prime number?
No. 59022 = 2 × × 1093, so it is divisible by 2.
What are the factors of 59022?
1, 2, 3, 6, 9, 18, 27, 54, 1093, 2186, 3279, 6558, 9837, 19674, 29511, 59022.
What is 59022 in binary?
1110011010001110 (hexadecimal E68E, octal 163216).
What is the square root of 59022?
About 242.9444, exactly 3√6558.
Is 59022 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 59022?
59022 is a Harshad number: divisible by its digit sum 18.