The number 59490
59490 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 661. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 661, 1322, 1983, 3305 … 59490.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59490: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
59490 is composite. Its prime factorisation is
- 3
The divisors add up to 154908; without 59490 itself that is 95418, so 59490 is abundant (95418 is more than 59490). Euler's totient φ(59490) = 15840 numbers up to 59490 share no factor with it.
- 4
The digits of 59490 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59490 = 2 \times 3^{2} \times 5 \times 661 \]59490 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 154908 |
| Euler totient φ(n) | 15840 |
| Square | 3539060100 |
| Cube | 210538685349000 |
| Square root | 243.905719 (= 3√6610) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.949 × |
59490 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and ninety |
| Binary (base 2) | 1110100001100010 |
| Octal (base 8) | 164142 |
| Hexadecimal (base 16) | E862 |
| Base 3 | 10000121100 |
| As time | 59490 seconds = 16 h 31 min 30 s |
Is 59490 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59490 ÷ 2 = 29745) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59490 ÷ 3 = 19830) | 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 | Yes (59490 ÷ 5 = 11898) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (59490 ÷ 6 = 9915) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (59490 ÷ 9 = 6610) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59490 ÷ 10 = 5949) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 59490 a prime number?
No. 59490 = 2 × × 5 × 661, so it is divisible by 2.
What are the factors of 59490?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 661, 1322, 1983, 3305, 3966, 5949, 6610, 9915, 11898, 19830, 29745, 59490.
What is 59490 in binary?
1110100001100010 (hexadecimal E862, octal 164142).
What is the square root of 59490?
About 243.9057, exactly 3√6610.
Is 59490 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 59490?
59490 is a happy number: repeatedly adding the squares of its digits reaches 1.