The number 56035
56035 is a composite number with 8 divisors. Its prime factorisation is 5 × 7 × 1601. Divisors (8): 1, 5, 7, 35, 1601, 8005, 11207, 56035.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56035 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56035 is composite. Its prime factorisation is
- 3
The divisors add up to 76896; without 56035 itself that is 20861, so 56035 is deficient (20861 is less than 56035). Euler's totient φ(56035) = 38400 numbers up to 56035 share no factor with it.
- 4
The digits of 56035 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56035 = 5 \times 7 \times 1601 \]
56035 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76896 |
| Euler totient φ(n) | 38400 |
| Square | 3139921225 |
| Cube | 175945485842875 |
| Square root | 236.717131 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6035 × |
56035 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and thirty-five |
| Binary (base 2) | 1101101011100011 |
| Octal (base 8) | 155343 |
| Hexadecimal (base 16) | DAE3 |
| Base 3 | 2211212101 |
| As time | 56035 seconds = 15 h 33 min 55 s |
Is 56035 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 (56035 ÷ 5 = 11207) | 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 | Yes (56035 ÷ 7 = 8005) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | 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 56035 a prime number?
No. 56035 = 5 × 7 × 1601, so it is divisible by 5.
What are the factors of 56035?
1, 5, 7, 35, 1601, 8005, 11207, 56035.
What is 56035 in binary?
1101101011100011 (hexadecimal DAE3, octal 155343).
What is the square root of 56035?
About 236.7171.
Is 56035 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 56035?
It is a composite number with 8 divisors.