The number 51505
51505 is a composite number with 4 divisors. Its prime factorisation is 5 × 10301. Divisors (4): 1, 5, 10301, 51505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51505: a semiprime: 5 × 10301, the product of two primes.
- 2
51505 is composite. Its prime factorisation is
- 3
The divisors add up to 61812; without 51505 itself that is 10307, so 51505 is deficient (10307 is less than 51505). Euler's totient φ(51505) = 41200 numbers up to 51505 share no factor with it.
- 4
The digits of 51505 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51505 = 5 \times 10301 \]
51505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61812 |
| Euler totient φ(n) | 41200 |
| Square | 2652765025 |
| Cube | 136630662612625 |
| Square root | 226.947130 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1505 × |
51505 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and five |
| Binary (base 2) | 1100100100110001 |
| Octal (base 8) | 144461 |
| Hexadecimal (base 16) | C931 |
| Base 3 | 2121122121 |
| As time | 51505 seconds = 14 h 18 min 25 s |
Is 51505 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 (51505 ÷ 5 = 10301) | 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 6) | 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 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51505 a prime number?
No. 51505 = 5 × 10301, so it is divisible by 5.
What are the factors of 51505?
1, 5, 10301, 51505.
What is 51505 in binary?
1100100100110001 (hexadecimal C931, octal 144461).
What is the square root of 51505?
About 226.9471.
Is 51505 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51505?
51505 is a semiprime: 5 × 10301, the product of two primes.