The number 50305
50305 is a palindrome: it reads 50305 backwards too. Its prime factorisation is 5 × 10061. Divisors (4): 1, 5, 10061, 50305.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50305: a palindrome: it reads 50305 backwards too; a semiprime: 5 × 10061, the product of two primes.
- 2
50305 is composite. Its prime factorisation is
- 3
The divisors add up to 60372; without 50305 itself that is 10067, so 50305 is deficient (10067 is less than 50305). Euler's totient φ(50305) = 40240 numbers up to 50305 share no factor with it.
- 4
The digits of 50305 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
\[ 50305 = 5 \times 10061 \]
50305 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60372 |
| Euler totient φ(n) | 40240 |
| Square | 2530593025 |
| Cube | 127301482122625 |
| Square root | 224.287762 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0305 × |
50305 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and five |
| Binary (base 2) | 1100010010000001 |
| Octal (base 8) | 142201 |
| Hexadecimal (base 16) | C481 |
| Base 3 | 2120000011 |
| As time | 50305 seconds = 13 h 58 min 25 s |
Is 50305 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 (50305 ÷ 5 = 10061) | 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 3) | 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 4) | 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 2) | 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 50305 a prime number?
No. 50305 = 5 × 10061, so it is divisible by 5.
What are the factors of 50305?
1, 5, 10061, 50305.
What is 50305 in binary?
1100010010000001 (hexadecimal C481, octal 142201).
What is the square root of 50305?
About 224.2878.
Is 50305 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 50305?
50305 is a palindrome: it reads 50305 backwards too; a semiprime: 5 × 10061, the product of two primes.