The number 51401
51401 is a composite number with 6 divisors. Its prime factorisation is Ć 1049. Divisors (6): 1, 7, 49, 1049, 7343, 51401.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51401 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51401 is composite. Its prime factorisation is
- 3
The divisors add up to 59850; without 51401 itself that is 8449, so 51401 is deficient (8449 is less than 51401). Euler's totient Ļ(51401) = 44016 numbers up to 51401 share no factor with it.
- 4
The digits of 51401 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51401 = 7^{2} \times 1049 \]51401 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 59850 |
| Euler totient Ļ(n) | 44016 |
| Square | 2642062801 |
| Cube | 135804670034201 |
| Square root | 226.717886 (= 7ā1049) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1401 Ć |
51401 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and one |
| Binary (base 2) | 1100100011001001 |
| Octal (base 8) | 144311 |
| Hexadecimal (base 16) | C8C9 |
| Base 3 | 2121111202 |
| As time | 51401 seconds = 14 h 16 min 41 s |
Is 51401 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 | Yes (51401 Ć· 7 = 7343) | 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 2) | 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 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 51401 a prime number?
No. 51401 = Ć 1049, so it is divisible by 7.
What are the factors of 51401?
1, 7, 49, 1049, 7343, 51401.
What is 51401 in binary?
1100100011001001 (hexadecimal C8C9, octal 144311).
What is the square root of 51401?
About 226.7179, exactly 7ā1049.
Is 51401 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 51401?
It is a composite number with 6 divisors.