The number 21593
21593 is a composite number with 8 divisors. Its prime factorisation is 11 × 13 × 151. Divisors (8): 1, 11, 13, 143, 151, 1661, 1963, 21593.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
21593 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
21593 is composite. Its prime factorisation is
- 3
The divisors add up to 25536; without 21593 itself that is 3943, so 21593 is deficient (3943 is less than 21593). Euler's totient φ(21593) = 18000 numbers up to 21593 share no factor with it.
- 4
The digits of 21593 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 69 steps to reach 1.
LaTeX source of the formulas on this page
\[ 21593 = 11 \times 13 \times 151 \]
21593 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25536 |
| Euler totient φ(n) | 18000 |
| Square | 466257649 |
| Cube | 10067901414857 |
| Square root | 146.945568 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 69 |
| Scientific notation | 2.1593 × |
21593 in other forms
| Form | Value |
|---|---|
| In words | twenty-one thousand five hundred and ninety-three |
| Binary (base 2) | 101010001011001 |
| Octal (base 8) | 52131 |
| Hexadecimal (base 16) | 5459 |
| Base 3 | 1002121202 |
| As time | 21593 seconds = 5 h 59 min 53 s |
Is 21593 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 3) | 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 5) | 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 2) | 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 | Yes (21593 ÷ 11 = 1963) | 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 21593 a prime number?
No. 21593 = 11 × 13 × 151, so it is divisible by 11.
What are the factors of 21593?
1, 11, 13, 143, 151, 1661, 1963, 21593.
What is 21593 in binary?
101010001011001 (hexadecimal 5459, octal 52131).
What is the square root of 21593?
About 146.9456.
Is 21593 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 21593?
It is a composite number with 8 divisors.