The number 59230
59230 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5923. Divisors (8): 1, 2, 5, 10, 5923, 11846, 29615, 59230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59230 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59230 is composite. Its prime factorisation is
- 3
The divisors add up to 106632; without 59230 itself that is 47402, so 59230 is deficient (47402 is less than 59230). Euler's totient φ(59230) = 23688 numbers up to 59230 share no factor with it.
- 4
The digits of 59230 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59230 = 2 \times 5 \times 5923 \]
59230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 106632 |
| Euler totient φ(n) | 23688 |
| Square | 3508192900 |
| Cube | 207790265467000 |
| Square root | 243.372143 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.923 × |
59230 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand two hundred and thirty |
| Binary (base 2) | 1110011101011110 |
| Octal (base 8) | 163536 |
| Hexadecimal (base 16) | E75E |
| Base 3 | 10000020201 |
| As time | 59230 seconds = 16 h 27 min 10 s |
Is 59230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59230 ÷ 2 = 29615) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (59230 ÷ 5 = 11846) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59230 ÷ 10 = 5923) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59230 a prime number?
No. 59230 = 2 × 5 × 5923, so it is divisible by 2.
What are the factors of 59230?
1, 2, 5, 10, 5923, 11846, 29615, 59230.
What is 59230 in binary?
1110011101011110 (hexadecimal E75E, octal 163536).
What is the square root of 59230?
About 243.3721.
Is 59230 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 59230?
It is a composite number with 8 divisors.