The number 51005
51005 is a composite number with 6 divisors. Its prime factorisation is 5 Ć . Divisors (6): 1, 5, 101, 505, 10201, 51005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51005 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51005 is composite. Its prime factorisation is
- 3
The divisors add up to 61818; without 51005 itself that is 10813, so 51005 is deficient (10813 is less than 51005). Euler's totient Ļ(51005) = 40400 numbers up to 51005 share no factor with it.
- 4
The digits of 51005 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51005 = 5 \times 101^{2} \]51005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 61818 |
| Euler totient Ļ(n) | 40400 |
| Square | 2601510025 |
| Cube | 132690018825125 |
| Square root | 225.842866 (= 101ā5) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1005 Ć |
51005 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and five |
| Binary (base 2) | 1100011100111101 |
| Octal (base 8) | 143475 |
| Hexadecimal (base 16) | C73D |
| Base 3 | 2120222002 |
| As time | 51005 seconds = 14 h 10 min 5 s |
Is 51005 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 (51005 Ć· 5 = 10201) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 9) | 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 51005 a prime number?
No. 51005 = 5 Ć , so it is divisible by 5.
What are the factors of 51005?
1, 5, 101, 505, 10201, 51005.
What is 51005 in binary?
1100011100111101 (hexadecimal C73D, octal 143475).
What is the square root of 51005?
About 225.8429, exactly 101ā5.
Is 51005 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 51005?
It is a composite number with 6 divisors.