The number 56063
56063 is a composite number with 4 divisors. Its prime factorisation is 7 × 8009. Divisors (4): 1, 7, 8009, 56063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56063: a semiprime: 7 × 8009, the product of two primes.
- 2
56063 is composite. Its prime factorisation is
- 3
The divisors add up to 64080; without 56063 itself that is 8017, so 56063 is deficient (8017 is less than 56063). Euler's totient φ(56063) = 48048 numbers up to 56063 share no factor with it.
- 4
The digits of 56063 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 259 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56063 = 7 \times 8009 \]
56063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64080 |
| Euler totient φ(n) | 48048 |
| Square | 3143059969 |
| Cube | 176209371042047 |
| Square root | 236.776266 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 259 |
| Scientific notation | 5.6063 × |
56063 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and sixty-three |
| Binary (base 2) | 1101101011111111 |
| Octal (base 8) | 155377 |
| Hexadecimal (base 16) | DAFF |
| Base 3 | 2211220102 |
| As time | 56063 seconds = 15 h 34 min 23 s |
Is 56063 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 2) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (56063 ÷ 7 = 8009) | 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 2) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56063 a prime number?
No. 56063 = 7 × 8009, so it is divisible by 7.
What are the factors of 56063?
1, 7, 8009, 56063.
What is 56063 in binary?
1101101011111111 (hexadecimal DAFF, octal 155377).
What is the square root of 56063?
About 236.7763.
Is 56063 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 56063?
56063 is a semiprime: 7 × 8009, the product of two primes.