The number 56507
56507 is a composite number with 6 divisors. Its prime factorisation is Ć 467. Divisors (6): 1, 11, 121, 467, 5137, 56507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56507 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56507 is composite. Its prime factorisation is
- 3
The divisors add up to 62244; without 56507 itself that is 5737, so 56507 is deficient (5737 is less than 56507). Euler's totient Ļ(56507) = 51260 numbers up to 56507 share no factor with it.
- 4
The digits of 56507 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56507 = 11^{2} \times 467 \]56507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 62244 |
| Euler totient Ļ(n) | 51260 |
| Square | 3193041049 |
| Cube | 180429170555843 |
| Square root | 237.712011 (= 11ā467) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.6507 Ć |
56507 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand five hundred and seven |
| Binary (base 2) | 1101110010111011 |
| Octal (base 8) | 156273 |
| Hexadecimal (base 16) | DCBB |
| Base 3 | 2212111212 |
| As time | 56507 seconds = 15 h 41 min 47 s |
Is 56507 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 | No (remainder 2) | 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (56507 Ć· 11 = 5137) | 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 56507 a prime number?
No. 56507 = Ć 467, so it is divisible by 11.
What are the factors of 56507?
1, 11, 121, 467, 5137, 56507.
What is 56507 in binary?
1101110010111011 (hexadecimal DCBB, octal 156273).
What is the square root of 56507?
About 237.7120, exactly 11ā467.
Is 56507 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 56507?
It is a composite number with 6 divisors.