The number 56335
56335 is a composite number with 8 divisors. Its prime factorisation is 5 × 19 × 593. Divisors (8): 1, 5, 19, 95, 593, 2965, 11267, 56335.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56335 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56335 is composite. Its prime factorisation is
- 3
The divisors add up to 71280; without 56335 itself that is 14945, so 56335 is deficient (14945 is less than 56335). Euler's totient φ(56335) = 42624 numbers up to 56335 share no factor with it.
- 4
The digits of 56335 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56335 = 5 \times 19 \times 593 \]
56335 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71280 |
| Euler totient φ(n) | 42624 |
| Square | 3173632225 |
| Cube | 178786571395375 |
| Square root | 237.349953 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.6335 × |
56335 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand three hundred and thirty-five |
| Binary (base 2) | 1101110000001111 |
| Octal (base 8) | 156017 |
| Hexadecimal (base 16) | DC0F |
| Base 3 | 2212021111 |
| As time | 56335 seconds = 15 h 38 min 55 s |
Is 56335 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (56335 ÷ 5 = 11267) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56335 a prime number?
No. 56335 = 5 × 19 × 593, so it is divisible by 5.
What are the factors of 56335?
1, 5, 19, 95, 593, 2965, 11267, 56335.
What is 56335 in binary?
1101110000001111 (hexadecimal DC0F, octal 156017).
What is the square root of 56335?
About 237.3500.
Is 56335 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 56335?
It is a composite number with 8 divisors.