The number 50405
50405 is a palindrome: it reads 50405 backwards too. Its prime factorisation is 5 × 17 × 593. Divisors (8): 1, 5, 17, 85, 593, 2965, 10081, 50405.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50405: a palindrome: it reads 50405 backwards too.
- 2
50405 is composite. Its prime factorisation is
- 3
The divisors add up to 64152; without 50405 itself that is 13747, so 50405 is deficient (13747 is less than 50405). Euler's totient φ(50405) = 37888 numbers up to 50405 share no factor with it.
- 4
The digits of 50405 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50405 = 5 \times 17 \times 593 \]
50405 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 64152 |
| Euler totient φ(n) | 37888 |
| Square | 2540664025 |
| Cube | 128062170180125 |
| Square root | 224.510579 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0405 × |
50405 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand four hundred and five |
| Binary (base 2) | 1100010011100101 |
| Octal (base 8) | 142345 |
| Hexadecimal (base 16) | C4E5 |
| Base 3 | 2120010212 |
| As time | 50405 seconds = 14 h 0 min 5 s |
Is 50405 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 | Yes (50405 ÷ 5 = 10081) | 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 5) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 50405 a prime number?
No. 50405 = 5 × 17 × 593, so it is divisible by 5.
What are the factors of 50405?
1, 5, 17, 85, 593, 2965, 10081, 50405.
What is 50405 in binary?
1100010011100101 (hexadecimal C4E5, octal 142345).
What is the square root of 50405?
About 224.5106.
Is 50405 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50405?
50405 is a palindrome: it reads 50405 backwards too.