The number 51215
51215 is a palindrome: it reads 51215 backwards too. Its prime factorisation is 5 × 10243. Divisors (4): 1, 5, 10243, 51215.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51215: a palindrome: it reads 51215 backwards too; a semiprime: 5 × 10243, the product of two primes.
- 2
51215 is composite. Its prime factorisation is
- 3
The divisors add up to 61464; without 51215 itself that is 10249, so 51215 is deficient (10249 is less than 51215). Euler's totient φ(51215) = 40968 numbers up to 51215 share no factor with it.
- 4
The digits of 51215 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
\[ 51215 = 5 \times 10243 \]
51215 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61464 |
| Euler totient φ(n) | 40968 |
| Square | 2622976225 |
| Cube | 134335727363375 |
| Square root | 226.307313 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1215 × |
51215 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and fifteen |
| Binary (base 2) | 1100100000001111 |
| Octal (base 8) | 144017 |
| Hexadecimal (base 16) | C80F |
| Base 3 | 2121020212 |
| As time | 51215 seconds = 14 h 13 min 35 s |
Is 51215 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 (51215 ÷ 5 = 10243) | 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 3) | 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 7) | 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 10) | 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 51215 a prime number?
No. 51215 = 5 × 10243, so it is divisible by 5.
What are the factors of 51215?
1, 5, 10243, 51215.
What is 51215 in binary?
1100100000001111 (hexadecimal C80F, octal 144017).
What is the square root of 51215?
About 226.3073.
Is 51215 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51215?
51215 is a palindrome: it reads 51215 backwards too; a semiprime: 5 × 10243, the product of two primes.