The number 15393
15393 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 733. Divisors (8): 1, 3, 7, 21, 733, 2199, 5131, 15393.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15393: a Harshad number: divisible by its digit sum 21.
- 2
15393 is composite. Its prime factorisation is
- 3
The divisors add up to 23488; without 15393 itself that is 8095, so 15393 is deficient (8095 is less than 15393). Euler's totient φ(15393) = 8784 numbers up to 15393 share no factor with it.
- 4
The digits of 15393 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15393 = 3 \times 7 \times 733 \]
15393 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23488 |
| Euler totient φ(n) | 8784 |
| Square | 236944449 |
| Cube | 3647285903457 |
| Square root | 124.068529 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.5393 × |
15393 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and ninety-three |
| Binary (base 2) | 11110000100001 |
| Octal (base 8) | 36041 |
| Hexadecimal (base 16) | 3C21 |
| Base 3 | 210010010 |
| As time | 15393 seconds = 4 h 16 min 33 s |
Is 15393 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 | Yes (15393 ÷ 3 = 5131) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15393 ÷ 7 = 2199) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15393 a prime number?
No. 15393 = 3 × 7 × 733, so it is divisible by 3.
What are the factors of 15393?
1, 3, 7, 21, 733, 2199, 5131, 15393.
What is 15393 in binary?
11110000100001 (hexadecimal 3C21, octal 36041).
What is the square root of 15393?
About 124.0685.
Is 15393 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15393?
15393 is a Harshad number: divisible by its digit sum 21.