The number 56495
56495 is a composite number with 4 divisors. Its prime factorisation is 5 × 11299. Divisors (4): 1, 5, 11299, 56495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56495: a semiprime: 5 × 11299, the product of two primes.
- 2
56495 is composite. Its prime factorisation is
- 3
The divisors add up to 67800; without 56495 itself that is 11305, so 56495 is deficient (11305 is less than 56495). Euler's totient φ(56495) = 45192 numbers up to 56495 share no factor with it.
- 4
The digits of 56495 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56495 = 5 \times 11299 \]
56495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 67800 |
| Euler totient φ(n) | 45192 |
| Square | 3191685025 |
| Cube | 180314245487375 |
| Square root | 237.686769 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.6495 × |
56495 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand four hundred and ninety-five |
| Binary (base 2) | 1101110010101111 |
| Octal (base 8) | 156257 |
| Hexadecimal (base 16) | DCAF |
| Base 3 | 2212111102 |
| As time | 56495 seconds = 15 h 41 min 35 s |
Is 56495 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 (56495 ÷ 5 = 11299) | 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 5) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 56495 a prime number?
No. 56495 = 5 × 11299, so it is divisible by 5.
What are the factors of 56495?
1, 5, 11299, 56495.
What is 56495 in binary?
1101110010101111 (hexadecimal DCAF, octal 156257).
What is the square root of 56495?
About 237.6868.
Is 56495 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 56495?
56495 is a semiprime: 5 × 11299, the product of two primes.