The number 56019
56019 is a composite number with 8 divisors. Its prime factorisation is 3 × 71 × 263. Divisors (8): 1, 3, 71, 213, 263, 789, 18673, 56019.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56019 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56019 is composite. Its prime factorisation is
- 3
The divisors add up to 76032; without 56019 itself that is 20013, so 56019 is deficient (20013 is less than 56019). Euler's totient φ(56019) = 36680 numbers up to 56019 share no factor with it.
- 4
The digits of 56019 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 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56019 = 3 \times 71 \times 263 \]
56019 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 76032 |
| Euler totient φ(n) | 36680 |
| Square | 3138128361 |
| Cube | 175794812654859 |
| Square root | 236.683333 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6019 × |
56019 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and nineteen |
| Binary (base 2) | 1101101011010011 |
| Octal (base 8) | 155323 |
| Hexadecimal (base 16) | DAD3 |
| Base 3 | 2211211210 |
| As time | 56019 seconds = 15 h 33 min 39 s |
Is 56019 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 (56019 ÷ 3 = 18673) | 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 | No (remainder 4) | 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 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 3) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56019 a prime number?
No. 56019 = 3 × 71 × 263, so it is divisible by 3.
What are the factors of 56019?
1, 3, 71, 213, 263, 789, 18673, 56019.
What is 56019 in binary?
1101101011010011 (hexadecimal DAD3, octal 155323).
What is the square root of 56019?
About 236.6833.
Is 56019 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 56019?
It is a composite number with 8 divisors.