The number 51213
51213 is a composite number with 8 divisors. Its prime factorisation is 3 × 43 × 397. Divisors (8): 1, 3, 43, 129, 397, 1191, 17071, 51213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51213 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51213 is composite. Its prime factorisation is
- 3
The divisors add up to 70048; without 51213 itself that is 18835, so 51213 is deficient (18835 is less than 51213). Euler's totient φ(51213) = 33264 numbers up to 51213 share no factor with it.
- 4
The digits of 51213 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51213 = 3 \times 43 \times 397 \]
51213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70048 |
| Euler totient φ(n) | 33264 |
| Square | 2622771369 |
| Cube | 134319990120597 |
| Square root | 226.302894 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1213 × |
51213 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and thirteen |
| Binary (base 2) | 1100100000001101 |
| Octal (base 8) | 144015 |
| Hexadecimal (base 16) | C80D |
| Base 3 | 2121020210 |
| As time | 51213 seconds = 14 h 13 min 33 s |
Is 51213 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 (51213 ÷ 3 = 17071) | 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 3) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51213 a prime number?
No. 51213 = 3 × 43 × 397, so it is divisible by 3.
What are the factors of 51213?
1, 3, 43, 129, 397, 1191, 17071, 51213.
What is 51213 in binary?
1100100000001101 (hexadecimal C80D, octal 144015).
What is the square root of 51213?
About 226.3029.
Is 51213 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51213?
It is a composite number with 8 divisors.