The number 59930
59930 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 461. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 130, 461, 922, 2305, 4610, 5993, 11986, 29965, 59930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59930: a Harshad number: divisible by its digit sum 26.
- 2
59930 is composite. Its prime factorisation is
- 3
The divisors add up to 116424; without 59930 itself that is 56494, so 59930 is deficient (56494 is less than 59930). Euler's totient φ(59930) = 22080 numbers up to 59930 share no factor with it.
- 4
The digits of 59930 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59930 = 2 \times 5 \times 13 \times 461 \]
59930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 116424 |
| Euler totient φ(n) | 22080 |
| Square | 3591604900 |
| Cube | 215244881657000 |
| Square root | 244.806046 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.993 × |
59930 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and thirty |
| Binary (base 2) | 1110101000011010 |
| Octal (base 8) | 165032 |
| Hexadecimal (base 16) | EA1A |
| Base 3 | 10001012122 |
| As time | 59930 seconds = 16 h 38 min 50 s |
Is 59930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59930 ÷ 2 = 29965) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (59930 ÷ 5 = 11986) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59930 ÷ 10 = 5993) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59930 a prime number?
No. 59930 = 2 × 5 × 13 × 461, so it is divisible by 2.
What are the factors of 59930?
1, 2, 5, 10, 13, 26, 65, 130, 461, 922, 2305, 4610, 5993, 11986, 29965, 59930.
What is 59930 in binary?
1110101000011010 (hexadecimal EA1A, octal 165032).
What is the square root of 59930?
About 244.8060.
Is 59930 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 59930?
59930 is a Harshad number: divisible by its digit sum 26.