The number 5993
5993 is a composite number with 4 divisors. Its prime factorisation is 13 × 461. Divisors (4): 1, 13, 461, 5993.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5993: a semiprime: 13 × 461, the product of two primes.
- 2
5993 is composite. Its prime factorisation is
- 3
The divisors add up to 6468; without 5993 itself that is 475, so 5993 is deficient (475 is less than 5993). Euler's totient φ(5993) = 5520 numbers up to 5993 share no factor with it.
- 4
The digits of 5993 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 80 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5993 = 13 \times 461 \]
5993 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6468 |
| Euler totient φ(n) | 5520 |
| Square | 35916049 |
| Cube | 215244881657 |
| Square root | 77.414469 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 80 |
| Scientific notation | 5.993 × |
5993 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and ninety-three |
| Binary (base 2) | 1011101101001 |
| Octal (base 8) | 13551 |
| Hexadecimal (base 16) | 1769 |
| Base 3 | 22012222 |
| As time | 5993 seconds = 1 h 39 min 53 s |
Is 5993 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 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 5993 a prime number?
No. 5993 = 13 × 461, so it is divisible by 13.
What are the factors of 5993?
1, 13, 461, 5993.
What is 5993 in binary?
1011101101001 (hexadecimal 1769, octal 13551).
What is the square root of 5993?
About 77.4145.
Is 5993 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 5993?
5993 is a semiprime: 13 × 461, the product of two primes.