The number 56031
56031 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 983. Divisors (8): 1, 3, 19, 57, 983, 2949, 18677, 56031.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56031 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56031 is composite. Its prime factorisation is
- 3
The divisors add up to 78720; without 56031 itself that is 22689, so 56031 is deficient (22689 is less than 56031). Euler's totient φ(56031) = 35352 numbers up to 56031 share no factor with it.
- 4
The digits of 56031 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56031 = 3 \times 19 \times 983 \]
56031 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78720 |
| Euler totient φ(n) | 35352 |
| Square | 3139472961 |
| Cube | 175907809477791 |
| Square root | 236.708682 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6031 × |
56031 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and thirty-one |
| Binary (base 2) | 1101101011011111 |
| Octal (base 8) | 155337 |
| Hexadecimal (base 16) | DADF |
| Base 3 | 2211212020 |
| As time | 56031 seconds = 15 h 33 min 51 s |
Is 56031 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 (56031 ÷ 3 = 18677) | 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 1) | 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 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 56031 a prime number?
No. 56031 = 3 × 19 × 983, so it is divisible by 3.
What are the factors of 56031?
1, 3, 19, 57, 983, 2949, 18677, 56031.
What is 56031 in binary?
1101101011011111 (hexadecimal DADF, octal 155337).
What is the square root of 56031?
About 236.7087.
Is 56031 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 56031?
It is a composite number with 8 divisors.