The number 15390
15390 is a composite number with 40 divisors. Its prime factorisation is 2 × × 5 × 19. Divisors (40): 1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 27, 30, 38, 45, 54, 57 … 15390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15390: a Harshad number: divisible by its digit sum 18.
- 2
15390 is composite. Its prime factorisation is
- 3
The divisors add up to 43560; without 15390 itself that is 28170, so 15390 is abundant (28170 is more than 15390). Euler's totient φ(15390) = 3888 numbers up to 15390 share no factor with it.
- 4
The digits of 15390 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15390 = 2 \times 3^{4} \times 5 \times 19 \]15390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 43560 |
| Euler totient φ(n) | 3888 |
| Square | 236852100 |
| Cube | 3645153819000 |
| Square root | 124.056439 (= 9√190) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.539 × |
15390 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and ninety |
| Binary (base 2) | 11110000011110 |
| Octal (base 8) | 36036 |
| Hexadecimal (base 16) | 3C1E |
| Base 3 | 210010000 |
| As time | 15390 seconds = 4 h 16 min 30 s |
Is 15390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15390 ÷ 2 = 7695) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15390 ÷ 3 = 5130) | 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 (15390 ÷ 5 = 3078) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15390 ÷ 6 = 2565) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15390 ÷ 9 = 1710) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (15390 ÷ 10 = 1539) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 15390 a prime number?
No. 15390 = 2 × × 5 × 19, so it is divisible by 2.
What are the factors of 15390?
1, 2, 3, 5, 6, 9, 10, 15, 18, 19, 27, 30, 38, 45, 54, 57, 81, 90, 95, 114, 135, 162, 171, 190, 270, 285, 342, 405, 513, 570, 810, 855, 1026, 1539, 1710, 2565, 3078, 5130, 7695, 15390.
What is 15390 in binary?
11110000011110 (hexadecimal 3C1E, octal 36036).
What is the square root of 15390?
About 124.0564, exactly 9√190.
Is 15390 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15390?
15390 is a Harshad number: divisible by its digit sum 18.