The number 15093
15093 is a composite number with 16 divisors. Its prime factorisation is × 13 × 43. Divisors (16): 1, 3, 9, 13, 27, 39, 43, 117, 129, 351, 387, 559, 1161, 1677, 5031, 15093.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15093 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15093 is composite. Its prime factorisation is
- 3
The divisors add up to 24640; without 15093 itself that is 9547, so 15093 is deficient (9547 is less than 15093). Euler's totient φ(15093) = 9072 numbers up to 15093 share no factor with it.
- 4
The digits of 15093 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 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15093 = 3^{3} \times 13 \times 43 \]15093 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 24640 |
| Euler totient φ(n) | 9072 |
| Square | 227798649 |
| Cube | 3438165009357 |
| Square root | 122.853571 (= 3√1677) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5093 × |
15093 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and ninety-three |
| Binary (base 2) | 11101011110101 |
| Octal (base 8) | 35365 |
| Hexadecimal (base 16) | 3AF5 |
| Base 3 | 202201000 |
| As time | 15093 seconds = 4 h 11 min 33 s |
Is 15093 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 (15093 ÷ 3 = 5031) | 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 | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15093 ÷ 9 = 1677) | 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 1) | 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 15093 a prime number?
No. 15093 = × 13 × 43, so it is divisible by 3.
What are the factors of 15093?
1, 3, 9, 13, 27, 39, 43, 117, 129, 351, 387, 559, 1161, 1677, 5031, 15093.
What is 15093 in binary?
11101011110101 (hexadecimal 3AF5, octal 35365).
What is the square root of 15093?
About 122.8536, exactly 3√1677.
Is 15093 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15093?
It is a composite number with 16 divisors.