The number 5853
5853 is a composite number with 4 divisors. Its prime factorisation is 3 × 1951. Divisors (4): 1, 3, 1951, 5853.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5853: a semiprime: 3 × 1951, the product of two primes.
- 2
5853 is composite. Its prime factorisation is
- 3
The divisors add up to 7808; without 5853 itself that is 1955, so 5853 is deficient (1955 is less than 5853). Euler's totient φ(5853) = 3900 numbers up to 5853 share no factor with it.
- 4
The digits of 5853 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 142 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5853 = 3 \times 1951 \]
5853 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7808 |
| Euler totient φ(n) | 3900 |
| Square | 34257609 |
| Cube | 200509785477 |
| Square root | 76.504902 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 142 |
| Scientific notation | 5.853 × |
5853 in other forms
| Form | Value |
|---|---|
| In words | five thousand eight hundred and fifty-three |
| Binary (base 2) | 1011011011101 |
| Octal (base 8) | 13335 |
| Hexadecimal (base 16) | 16DD |
| Base 3 | 22000210 |
| As time | 5853 seconds = 1 h 37 min 33 s |
Is 5853 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 (5853 ÷ 3 = 1951) | 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 | 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 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 5853 a prime number?
No. 5853 = 3 × 1951, so it is divisible by 3.
What are the factors of 5853?
1, 3, 1951, 5853.
What is 5853 in binary?
1011011011101 (hexadecimal 16DD, octal 13335).
What is the square root of 5853?
About 76.5049.
Is 5853 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5853?
5853 is a semiprime: 3 × 1951, the product of two primes.