The number 15389
15389 is a composite number with 4 divisors. Its prime factorisation is 11 × 1399. Divisors (4): 1, 11, 1399, 15389.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15389: a semiprime: 11 × 1399, the product of two primes.
- 2
15389 is composite. Its prime factorisation is
- 3
The divisors add up to 16800; without 15389 itself that is 1411, so 15389 is deficient (1411 is less than 15389). Euler's totient φ(15389) = 13980 numbers up to 15389 share no factor with it.
- 4
The digits of 15389 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15389 = 11 \times 1399 \]
15389 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16800 |
| Euler totient φ(n) | 13980 |
| Square | 236821321 |
| Cube | 3644443308869 |
| Square root | 124.052408 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5389 × |
15389 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and eighty-nine |
| Binary (base 2) | 11110000011101 |
| Octal (base 8) | 36035 |
| Hexadecimal (base 16) | 3C1D |
| Base 3 | 210002222 |
| As time | 15389 seconds = 4 h 16 min 29 s |
Is 15389 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 5) | 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 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (15389 ÷ 11 = 1399) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15389 a prime number?
No. 15389 = 11 × 1399, so it is divisible by 11.
What are the factors of 15389?
1, 11, 1399, 15389.
What is 15389 in binary?
11110000011101 (hexadecimal 3C1D, octal 36035).
What is the square root of 15389?
About 124.0524.
Is 15389 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 15389?
15389 is a semiprime: 11 × 1399, the product of two primes.