The number 51305
51305 is a composite number with 8 divisors. Its prime factorisation is 5 × 31 × 331. Divisors (8): 1, 5, 31, 155, 331, 1655, 10261, 51305.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51305 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51305 is composite. Its prime factorisation is
- 3
The divisors add up to 63744; without 51305 itself that is 12439, so 51305 is deficient (12439 is less than 51305). Euler's totient φ(51305) = 39600 numbers up to 51305 share no factor with it.
- 4
The digits of 51305 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51305 = 5 \times 31 \times 331 \]
51305 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 63744 |
| Euler totient φ(n) | 39600 |
| Square | 2632203025 |
| Cube | 135045176197625 |
| Square root | 226.506071 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1305 × |
51305 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and five |
| Binary (base 2) | 1100100001101001 |
| Octal (base 8) | 144151 |
| Hexadecimal (base 16) | C869 |
| Base 3 | 2121101012 |
| As time | 51305 seconds = 14 h 15 min 5 s |
Is 51305 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 (51305 ÷ 5 = 10261) | 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 2) | 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 5) | 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 1) | 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 51305 a prime number?
No. 51305 = 5 × 31 × 331, so it is divisible by 5.
What are the factors of 51305?
1, 5, 31, 155, 331, 1655, 10261, 51305.
What is 51305 in binary?
1100100001101001 (hexadecimal C869, octal 144151).
What is the square root of 51305?
About 226.5061.
Is 51305 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51305?
It is a composite number with 8 divisors.