The number 56913
56913 is a composite number with 8 divisors. Its prime factorisation is 3 × 61 × 311. Divisors (8): 1, 3, 61, 183, 311, 933, 18971, 56913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56913 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56913 is composite. Its prime factorisation is
- 3
The divisors add up to 77376; without 56913 itself that is 20463, so 56913 is deficient (20463 is less than 56913). Euler's totient φ(56913) = 37200 numbers up to 56913 share no factor with it.
- 4
The digits of 56913 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56913 = 3 \times 61 \times 311 \]
56913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77376 |
| Euler totient φ(n) | 37200 |
| Square | 3239089569 |
| Cube | 184346304640497 |
| Square root | 238.564457 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.6913 × |
56913 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and thirteen |
| Binary (base 2) | 1101111001010001 |
| Octal (base 8) | 157121 |
| Hexadecimal (base 16) | DE51 |
| Base 3 | 2220001220 |
| As time | 56913 seconds = 15 h 48 min 33 s |
Is 56913 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 (56913 ÷ 3 = 18971) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56913 a prime number?
No. 56913 = 3 × 61 × 311, so it is divisible by 3.
What are the factors of 56913?
1, 3, 61, 183, 311, 933, 18971, 56913.
What is 56913 in binary?
1101111001010001 (hexadecimal DE51, octal 157121).
What is the square root of 56913?
About 238.5645.
Is 56913 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 56913?
It is a composite number with 8 divisors.