The number 51315
51315 is a palindrome: it reads 51315 backwards too. Its prime factorisation is 3 × 5 × 11 × 311. Divisors (16): 1, 3, 5, 11, 15, 33, 55, 165, 311, 933, 1555, 3421, 4665, 10263, 17105, 51315.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51315: a palindrome: it reads 51315 backwards too; a Harshad number: divisible by its digit sum 15.
- 2
51315 is composite. Its prime factorisation is
- 3
The divisors add up to 89856; without 51315 itself that is 38541, so 51315 is deficient (38541 is less than 51315). Euler's totient φ(51315) = 24800 numbers up to 51315 share no factor with it.
- 4
The digits of 51315 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51315 = 3 \times 5 \times 11 \times 311 \]
51315 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 89856 |
| Euler totient φ(n) | 24800 |
| Square | 2633229225 |
| Cube | 135124157680875 |
| Square root | 226.528144 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1315 × |
51315 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and fifteen |
| Binary (base 2) | 1100100001110011 |
| Octal (base 8) | 144163 |
| Hexadecimal (base 16) | C873 |
| Base 3 | 2121101120 |
| As time | 51315 seconds = 14 h 15 min 15 s |
Is 51315 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 | Yes (51315 ÷ 3 = 17105) | 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 (51315 ÷ 5 = 10263) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 | Yes (51315 ÷ 11 = 4665) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51315 a prime number?
No. 51315 = 3 × 5 × 11 × 311, so it is divisible by 3.
What are the factors of 51315?
1, 3, 5, 11, 15, 33, 55, 165, 311, 933, 1555, 3421, 4665, 10263, 17105, 51315.
What is 51315 in binary?
1100100001110011 (hexadecimal C873, octal 144163).
What is the square root of 51315?
About 226.5281.
Is 51315 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51315?
51315 is a palindrome: it reads 51315 backwards too; a Harshad number: divisible by its digit sum 15.