The number 56013
56013 is a composite number with 4 divisors. Its prime factorisation is 3 × 18671. Divisors (4): 1, 3, 18671, 56013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56013: a semiprime: 3 × 18671, the product of two primes.
- 2
56013 is composite. Its prime factorisation is
- 3
The divisors add up to 74688; without 56013 itself that is 18675, so 56013 is deficient (18675 is less than 56013). Euler's totient φ(56013) = 37340 numbers up to 56013 share no factor with it.
- 4
The digits of 56013 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 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56013 = 3 \times 18671 \]
56013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 74688 |
| Euler totient φ(n) | 37340 |
| Square | 3137456169 |
| Cube | 175738332394197 |
| Square root | 236.670657 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.6013 × |
56013 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and thirteen |
| Binary (base 2) | 1101101011001101 |
| Octal (base 8) | 155315 |
| Hexadecimal (base 16) | DACD |
| Base 3 | 2211211120 |
| As time | 56013 seconds = 15 h 33 min 33 s |
Is 56013 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 (56013 ÷ 3 = 18671) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 5) | 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 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56013 a prime number?
No. 56013 = 3 × 18671, so it is divisible by 3.
What are the factors of 56013?
1, 3, 18671, 56013.
What is 56013 in binary?
1101101011001101 (hexadecimal DACD, octal 155315).
What is the square root of 56013?
About 236.6707.
Is 56013 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 56013?
56013 is a semiprime: 3 × 18671, the product of two primes.