The number 50913
50913 is a composite number with 6 divisors. Its prime factorisation is × 5657. Divisors (6): 1, 3, 9, 5657, 16971, 50913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50913 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50913 is composite. Its prime factorisation is
- 3
The divisors add up to 73554; without 50913 itself that is 22641, so 50913 is deficient (22641 is less than 50913). Euler's totient φ(50913) = 33936 numbers up to 50913 share no factor with it.
- 4
The digits of 50913 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50913 = 3^{2} \times 5657 \]50913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 73554 |
| Euler totient φ(n) | 33936 |
| Square | 2592133569 |
| Cube | 131973296398497 |
| Square root | 225.639092 (= 3√5657) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0913 × |
50913 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and thirteen |
| Binary (base 2) | 1100011011100001 |
| Octal (base 8) | 143341 |
| Hexadecimal (base 16) | C6E1 |
| Base 3 | 2120211200 |
| As time | 50913 seconds = 14 h 8 min 33 s |
Is 50913 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 (50913 ÷ 3 = 16971) | 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 2) | 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 | Yes (50913 ÷ 9 = 5657) | 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 5) | 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 50913 a prime number?
No. 50913 = × 5657, so it is divisible by 3.
What are the factors of 50913?
1, 3, 9, 5657, 16971, 50913.
What is 50913 in binary?
1100011011100001 (hexadecimal C6E1, octal 143341).
What is the square root of 50913?
About 225.6391, exactly 3√5657.
Is 50913 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50913?
It is a composite number with 6 divisors.