The number 50369
50369 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 241. Divisors (8): 1, 11, 19, 209, 241, 2651, 4579, 50369.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50369 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50369 is composite. Its prime factorisation is
- 3
The divisors add up to 58080; without 50369 itself that is 7711, so 50369 is deficient (7711 is less than 50369). Euler's totient φ(50369) = 43200 numbers up to 50369 share no factor with it.
- 4
The digits of 50369 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50369 = 11 \times 19 \times 241 \]
50369 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58080 |
| Euler totient φ(n) | 43200 |
| Square | 2537036161 |
| Cube | 127787974393409 |
| Square root | 224.430390 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0369 × |
50369 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and sixty-nine |
| Binary (base 2) | 1100010011000001 |
| Octal (base 8) | 142301 |
| Hexadecimal (base 16) | C4C1 |
| Base 3 | 2120002112 |
| As time | 50369 seconds = 13 h 59 min 29 s |
Is 50369 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 4) | 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 | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (50369 ÷ 11 = 4579) | 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 50369 a prime number?
No. 50369 = 11 × 19 × 241, so it is divisible by 11.
What are the factors of 50369?
1, 11, 19, 209, 241, 2651, 4579, 50369.
What is 50369 in binary?
1100010011000001 (hexadecimal C4C1, octal 142301).
What is the square root of 50369?
About 224.4304.
Is 50369 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50369?
It is a composite number with 8 divisors.