The number 56295
56295 is a composite number with 20 divisors. Its prime factorisation is × 5 × 139. Divisors (20): 1, 3, 5, 9, 15, 27, 45, 81, 135, 139, 405, 417, 695, 1251, 2085, 3753 … 56295.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56295: a Harshad number: divisible by its digit sum 27.
- 2
56295 is composite. Its prime factorisation is
- 3
The divisors add up to 101640; without 56295 itself that is 45345, so 56295 is deficient (45345 is less than 56295). Euler's totient φ(56295) = 29808 numbers up to 56295 share no factor with it.
- 4
The digits of 56295 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56295 = 3^{4} \times 5 \times 139 \]56295 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 101640 |
| Euler totient φ(n) | 29808 |
| Square | 3169127025 |
| Cube | 178406005872375 |
| Square root | 237.265674 (= 9√695) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.6295 × |
56295 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand two hundred and ninety-five |
| Binary (base 2) | 1101101111100111 |
| Octal (base 8) | 155747 |
| Hexadecimal (base 16) | DBE7 |
| Base 3 | 2212020000 |
| As time | 56295 seconds = 15 h 38 min 15 s |
Is 56295 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 (56295 ÷ 3 = 18765) | 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 (56295 ÷ 5 = 11259) | 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 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 | Yes (56295 ÷ 9 = 6255) | 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 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 56295 a prime number?
No. 56295 = × 5 × 139, so it is divisible by 3.
What are the factors of 56295?
1, 3, 5, 9, 15, 27, 45, 81, 135, 139, 405, 417, 695, 1251, 2085, 3753, 6255, 11259, 18765, 56295.
What is 56295 in binary?
1101101111100111 (hexadecimal DBE7, octal 155747).
What is the square root of 56295?
About 237.2657, exactly 9√695.
Is 56295 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 56295?
56295 is a Harshad number: divisible by its digit sum 27.