The number 50505
50505 is a palindrome: it reads 50505 backwards too. Its prime factorisation is 3 × 5 × 7 × 13 × 37. Divisors (32): 1, 3, 5, 7, 13, 15, 21, 35, 37, 39, 65, 91, 105, 111, 185, 195 … 50505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50505: a palindrome: it reads 50505 backwards too; a Harshad number: divisible by its digit sum 15.
- 2
50505 is composite. Its prime factorisation is
- 3
The divisors add up to 102144; without 50505 itself that is 51639, so 50505 is abundant (51639 is more than 50505). Euler's totient φ(50505) = 20736 numbers up to 50505 share no factor with it.
- 4
The digits of 50505 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50505 = 3 \times 5 \times 7 \times 13 \times 37 \]
50505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 102144 |
| Euler totient φ(n) | 20736 |
| Square | 2550755025 |
| Cube | 128825882537625 |
| Square root | 224.733175 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.0505 × |
50505 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and five |
| Binary (base 2) | 1100010101001001 |
| Octal (base 8) | 142511 |
| Hexadecimal (base 16) | C549 |
| Base 3 | 2120021120 |
| As time | 50505 seconds = 14 h 1 min 45 s |
Is 50505 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 | Yes (50505 ÷ 3 = 16835) | 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 (50505 ÷ 5 = 10101) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50505 ÷ 7 = 7215) | 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 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50505 a prime number?
No. 50505 = 3 × 5 × 7 × 13 × 37, so it is divisible by 3.
What are the factors of 50505?
1, 3, 5, 7, 13, 15, 21, 35, 37, 39, 65, 91, 105, 111, 185, 195, 259, 273, 455, 481, 555, 777, 1295, 1365, 1443, 2405, 3367, 3885, 7215, 10101, 16835, 50505.
What is 50505 in binary?
1100010101001001 (hexadecimal C549, octal 142511).
What is the square root of 50505?
About 224.7332.
Is 50505 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50505?
50505 is a palindrome: it reads 50505 backwards too; a Harshad number: divisible by its digit sum 15.