The number 56095
56095 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 863. Divisors (8): 1, 5, 13, 65, 863, 4315, 11219, 56095.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56095: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
56095 is composite. Its prime factorisation is
- 3
The divisors add up to 72576; without 56095 itself that is 16481, so 56095 is deficient (16481 is less than 56095). Euler's totient φ(56095) = 41376 numbers up to 56095 share no factor with it.
- 4
The digits of 56095 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 321 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56095 = 5 \times 13 \times 863 \]
56095 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 72576 |
| Euler totient φ(n) | 41376 |
| Square | 3146649025 |
| Cube | 176511277057375 |
| Square root | 236.843830 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 321 |
| Scientific notation | 5.6095 × |
56095 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand and ninety-five |
| Binary (base 2) | 1101101100011111 |
| Octal (base 8) | 155437 |
| Hexadecimal (base 16) | DB1F |
| Base 3 | 2211221121 |
| As time | 56095 seconds = 15 h 34 min 55 s |
Is 56095 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 1) | 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 (56095 ÷ 5 = 11219) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56095 a prime number?
No. 56095 = 5 × 13 × 863, so it is divisible by 5.
What are the factors of 56095?
1, 5, 13, 65, 863, 4315, 11219, 56095.
What is 56095 in binary?
1101101100011111 (hexadecimal DB1F, octal 155437).
What is the square root of 56095?
About 236.8438.
Is 56095 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 56095?
56095 is a happy number: repeatedly adding the squares of its digits reaches 1.