The number 19230
19230 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 641. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 641, 1282, 1923, 3205, 3846, 6410, 9615, 19230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19230: a Harshad number: divisible by its digit sum 15.
- 2
19230 is composite. Its prime factorisation is
- 3
The divisors add up to 46224; without 19230 itself that is 26994, so 19230 is abundant (26994 is more than 19230). Euler's totient φ(19230) = 5120 numbers up to 19230 share no factor with it.
- 4
The digits of 19230 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 123 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19230 = 2 \times 3 \times 5 \times 641 \]
19230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 46224 |
| Euler totient φ(n) | 5120 |
| Square | 369792900 |
| Cube | 7111117467000 |
| Square root | 138.672276 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 123 |
| Scientific notation | 1.923 × |
19230 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand two hundred and thirty |
| Binary (base 2) | 100101100011110 |
| Octal (base 8) | 45436 |
| Hexadecimal (base 16) | 4B1E |
| Base 3 | 222101020 |
| As time | 19230 seconds = 5 h 20 min 30 s |
Is 19230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19230 ÷ 2 = 9615) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (19230 ÷ 3 = 6410) | 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 (19230 ÷ 5 = 3846) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (19230 ÷ 6 = 3205) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (19230 ÷ 10 = 1923) | 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 19230 a prime number?
No. 19230 = 2 × 3 × 5 × 641, so it is divisible by 2.
What are the factors of 19230?
1, 2, 3, 5, 6, 10, 15, 30, 641, 1282, 1923, 3205, 3846, 6410, 9615, 19230.
What is 19230 in binary?
100101100011110 (hexadecimal 4B1E, octal 45436).
What is the square root of 19230?
About 138.6723.
Is 19230 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 19230?
19230 is a Harshad number: divisible by its digit sum 15.