The number 50313
50313 is a composite number with 8 divisors. Its prime factorisation is 3 × 31 × 541. Divisors (8): 1, 3, 31, 93, 541, 1623, 16771, 50313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50313: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50313 is composite. Its prime factorisation is
- 3
The divisors add up to 69376; without 50313 itself that is 19063, so 50313 is deficient (19063 is less than 50313). Euler's totient φ(50313) = 32400 numbers up to 50313 share no factor with it.
- 4
The digits of 50313 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 233 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50313 = 3 \times 31 \times 541 \]
50313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 69376 |
| Euler totient φ(n) | 32400 |
| Square | 2531397969 |
| Cube | 127362226014297 |
| Square root | 224.305595 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 233 |
| Scientific notation | 5.0313 × |
50313 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and thirteen |
| Binary (base 2) | 1100010010001001 |
| Octal (base 8) | 142211 |
| Hexadecimal (base 16) | C489 |
| Base 3 | 2120000110 |
| As time | 50313 seconds = 13 h 58 min 33 s |
Is 50313 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 (50313 ÷ 3 = 16771) | 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 4) | 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 3) | 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 50313 a prime number?
No. 50313 = 3 × 31 × 541, so it is divisible by 3.
What are the factors of 50313?
1, 3, 31, 93, 541, 1623, 16771, 50313.
What is 50313 in binary?
1100010010001001 (hexadecimal C489, octal 142211).
What is the square root of 50313?
About 224.3056.
Is 50313 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50313?
50313 is a happy number: repeatedly adding the squares of its digits reaches 1.