The number 51395
51395 is a composite number with 8 divisors. Its prime factorisation is 5 × 19 × 541. Divisors (8): 1, 5, 19, 95, 541, 2705, 10279, 51395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51395 is composite. Its prime factorisation is
- 3
The divisors add up to 65040; without 51395 itself that is 13645, so 51395 is deficient (13645 is less than 51395). Euler's totient φ(51395) = 38880 numbers up to 51395 share no factor with it.
- 4
The digits of 51395 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51395 = 5 \times 19 \times 541 \]
51395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 65040 |
| Euler totient φ(n) | 38880 |
| Square | 2641446025 |
| Cube | 135757118454875 |
| Square root | 226.704654 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.1395 × |
51395 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and ninety-five |
| Binary (base 2) | 1100100011000011 |
| Octal (base 8) | 144303 |
| Hexadecimal (base 16) | C8C3 |
| Base 3 | 2121111112 |
| As time | 51395 seconds = 14 h 16 min 35 s |
Is 51395 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51395 ÷ 5 = 10279) | 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 1) | 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 3) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51395 a prime number?
No. 51395 = 5 × 19 × 541, so it is divisible by 5.
What are the factors of 51395?
1, 5, 19, 95, 541, 2705, 10279, 51395.
What is 51395 in binary?
1100100011000011 (hexadecimal C8C3, octal 144303).
What is the square root of 51395?
About 226.7047.
Is 51395 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 51395?
It is a composite number with 8 divisors.