The number 50813
50813 is a composite number with 12 divisors. Its prime factorisation is × 17 × 61. Divisors (12): 1, 7, 17, 49, 61, 119, 427, 833, 1037, 2989, 7259, 50813.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50813: a Harshad number: divisible by its digit sum 17.
- 2
50813 is composite. Its prime factorisation is
- 3
The divisors add up to 63612; without 50813 itself that is 12799, so 50813 is deficient (12799 is less than 50813). Euler's totient φ(50813) = 40320 numbers up to 50813 share no factor with it.
- 4
The digits of 50813 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50813 = 7^{2} \times 17 \times 61 \]50813 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 63612 |
| Euler totient φ(n) | 40320 |
| Square | 2581960969 |
| Cube | 131197182717797 |
| Square root | 225.417391 (= 7√1037) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 145 |
| Scientific notation | 5.0813 × |
50813 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and thirteen |
| Binary (base 2) | 1100011001111101 |
| Octal (base 8) | 143175 |
| Hexadecimal (base 16) | C67D |
| Base 3 | 2120200222 |
| As time | 50813 seconds = 14 h 6 min 53 s |
Is 50813 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50813 ÷ 7 = 7259) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50813 a prime number?
No. 50813 = × 17 × 61, so it is divisible by 7.
What are the factors of 50813?
1, 7, 17, 49, 61, 119, 427, 833, 1037, 2989, 7259, 50813.
What is 50813 in binary?
1100011001111101 (hexadecimal C67D, octal 143175).
What is the square root of 50813?
About 225.4174, exactly 7√1037.
Is 50813 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50813?
50813 is a Harshad number: divisible by its digit sum 17.