The number 50905
50905 is a palindrome: it reads 50905 backwards too. Its prime factorisation is 5 × 10181. Divisors (4): 1, 5, 10181, 50905.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50905: a palindrome: it reads 50905 backwards too; a semiprime: 5 × 10181, the product of two primes.
- 2
50905 is composite. Its prime factorisation is
- 3
The divisors add up to 61092; without 50905 itself that is 10187, so 50905 is deficient (10187 is less than 50905). Euler's totient φ(50905) = 40720 numbers up to 50905 share no factor with it.
- 4
The digits of 50905 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50905 = 5 \times 10181 \]
50905 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61092 |
| Euler totient φ(n) | 40720 |
| Square | 2591319025 |
| Cube | 131911094967625 |
| Square root | 225.621364 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0905 × |
50905 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and five |
| Binary (base 2) | 1100011011011001 |
| Octal (base 8) | 143331 |
| Hexadecimal (base 16) | C6D9 |
| Base 3 | 2120211101 |
| As time | 50905 seconds = 14 h 8 min 25 s |
Is 50905 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50905 ÷ 5 = 10181) | 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 | No (remainder 1) | 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 1) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50905 a prime number?
No. 50905 = 5 × 10181, so it is divisible by 5.
What are the factors of 50905?
1, 5, 10181, 50905.
What is 50905 in binary?
1100011011011001 (hexadecimal C6D9, octal 143331).
What is the square root of 50905?
About 225.6214.
Is 50905 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 50905?
50905 is a palindrome: it reads 50905 backwards too; a semiprime: 5 × 10181, the product of two primes.