The number 51701
51701 is a composite number with 8 divisors. Its prime factorisation is 13 × 41 × 97. Divisors (8): 1, 13, 41, 97, 533, 1261, 3977, 51701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51701 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51701 is composite. Its prime factorisation is
- 3
The divisors add up to 57624; without 51701 itself that is 5923, so 51701 is deficient (5923 is less than 51701). Euler's totient φ(51701) = 46080 numbers up to 51701 share no factor with it.
- 4
The digits of 51701 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
\[ 51701 = 13 \times 41 \times 97 \]
51701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57624 |
| Euler totient φ(n) | 46080 |
| Square | 2672993401 |
| Cube | 138196431825101 |
| Square root | 227.378539 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1701 × |
51701 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand seven hundred and one |
| Binary (base 2) | 1100100111110101 |
| Octal (base 8) | 144765 |
| Hexadecimal (base 16) | C9F5 |
| Base 3 | 2121220212 |
| As time | 51701 seconds = 14 h 21 min 41 s |
Is 51701 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 | No (remainder 1) | 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 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 5) | 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 1) | 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 51701 a prime number?
No. 51701 = 13 × 41 × 97, so it is divisible by 13.
What are the factors of 51701?
1, 13, 41, 97, 533, 1261, 3977, 51701.
What is 51701 in binary?
1100100111110101 (hexadecimal C9F5, octal 144765).
What is the square root of 51701?
About 227.3785.
Is 51701 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51701?
It is a composite number with 8 divisors.