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