The number 50323
50323 is a composite number with 12 divisors. Its prime factorisation is × 13 × 79. Divisors (12): 1, 7, 13, 49, 79, 91, 553, 637, 1027, 3871, 7189, 50323.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50323: a Harshad number: divisible by its digit sum 13.
- 2
50323 is composite. Its prime factorisation is
- 3
The divisors add up to 63840; without 50323 itself that is 13517, so 50323 is deficient (13517 is less than 50323). Euler's totient φ(50323) = 39312 numbers up to 50323 share no factor with it.
- 4
The digits of 50323 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50323 = 7^{2} \times 13 \times 79 \]50323 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 63840 |
| Euler totient φ(n) | 39312 |
| Square | 2532404329 |
| Cube | 127438183048267 |
| Square root | 224.327885 (= 7√1027) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0323 × |
50323 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and twenty-three |
| Binary (base 2) | 1100010010010011 |
| Octal (base 8) | 142223 |
| Hexadecimal (base 16) | C493 |
| Base 3 | 2120000211 |
| As time | 50323 seconds = 13 h 58 min 43 s |
Is 50323 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50323 ÷ 7 = 7189) | 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 4) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50323 a prime number?
No. 50323 = × 13 × 79, so it is divisible by 7.
What are the factors of 50323?
1, 7, 13, 49, 79, 91, 553, 637, 1027, 3871, 7189, 50323.
What is 50323 in binary?
1100010010010011 (hexadecimal C493, octal 142223).
What is the square root of 50323?
About 224.3279, exactly 7√1027.
Is 50323 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50323?
50323 is a Harshad number: divisible by its digit sum 13.