The number 56015
56015 is a composite number with 8 divisors. Its prime factorisation is 5 × 17 × 659. Divisors (8): 1, 5, 17, 85, 659, 3295, 11203, 56015.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56015: a Harshad number: divisible by its digit sum 17.
- 2
56015 is composite. Its prime factorisation is
- 3
The divisors add up to 71280; without 56015 itself that is 15265, so 56015 is deficient (15265 is less than 56015). Euler's totient φ(56015) = 42112 numbers up to 56015 share no factor with it.
- 4
The digits of 56015 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56015 = 5 \times 17 \times 659 \]
56015 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71280 |
| Euler totient φ(n) | 42112 |
| Square | 3137680225 |
| Cube | 175757157803375 |
| Square root | 236.674882 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.6015 × |
56015 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and fifteen |
| Binary (base 2) | 1101101011001111 |
| Octal (base 8) | 155317 |
| Hexadecimal (base 16) | DACF |
| Base 3 | 2211211122 |
| As time | 56015 seconds = 15 h 33 min 35 s |
Is 56015 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 | Yes (56015 ÷ 5 = 11203) | 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 | No (remainder 1) | 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 8) | 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 3) | 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 56015 a prime number?
No. 56015 = 5 × 17 × 659, so it is divisible by 5.
What are the factors of 56015?
1, 5, 17, 85, 659, 3295, 11203, 56015.
What is 56015 in binary?
1101101011001111 (hexadecimal DACF, octal 155317).
What is the square root of 56015?
About 236.6749.
Is 56015 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 56015?
56015 is a Harshad number: divisible by its digit sum 17.