The number 51398
51398 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 829. Divisors (8): 1, 2, 31, 62, 829, 1658, 25699, 51398.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51398 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51398 is composite. Its prime factorisation is
- 3
The divisors add up to 79680; without 51398 itself that is 28282, so 51398 is deficient (28282 is less than 51398). Euler's totient φ(51398) = 24840 numbers up to 51398 share no factor with it.
- 4
The digits of 51398 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51398 = 2 \times 31 \times 829 \]
51398 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79680 |
| Euler totient φ(n) | 24840 |
| Square | 2641754404 |
| Cube | 135780892856792 |
| Square root | 226.711270 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1398 × |
51398 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and ninety-eight |
| Binary (base 2) | 1100100011000110 |
| Octal (base 8) | 144306 |
| Hexadecimal (base 16) | C8C6 |
| Base 3 | 2121111122 |
| As time | 51398 seconds = 14 h 16 min 38 s |
Is 51398 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51398 ÷ 2 = 25699) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51398 a prime number?
No. 51398 = 2 × 31 × 829, so it is divisible by 2.
What are the factors of 51398?
1, 2, 31, 62, 829, 1658, 25699, 51398.
What is 51398 in binary?
1100100011000110 (hexadecimal C8C6, octal 144306).
What is the square root of 51398?
About 226.7113.
Is 51398 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 51398?
It is a composite number with 8 divisors.