The number 51321
51321 is a composite number with 4 divisors. Its prime factorisation is 3 × 17107. Divisors (4): 1, 3, 17107, 51321.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51321: a semiprime: 3 × 17107, the product of two primes.
- 2
51321 is composite. Its prime factorisation is
- 3
The divisors add up to 68432; without 51321 itself that is 17111, so 51321 is deficient (17111 is less than 51321). Euler's totient φ(51321) = 34212 numbers up to 51321 share no factor with it.
- 4
The digits of 51321 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51321 = 3 \times 17107 \]
51321 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68432 |
| Euler totient φ(n) | 34212 |
| Square | 2633845041 |
| Cube | 135171561349161 |
| Square root | 226.541387 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.1321 × |
51321 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and twenty-one |
| Binary (base 2) | 1100100001111001 |
| Octal (base 8) | 144171 |
| Hexadecimal (base 16) | C879 |
| Base 3 | 2121101210 |
| As time | 51321 seconds = 14 h 15 min 21 s |
Is 51321 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 (51321 ÷ 3 = 17107) | 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 1) | 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 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 1) | 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 1) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51321 a prime number?
No. 51321 = 3 × 17107, so it is divisible by 3.
What are the factors of 51321?
1, 3, 17107, 51321.
What is 51321 in binary?
1100100001111001 (hexadecimal C879, octal 144171).
What is the square root of 51321?
About 226.5414.
Is 51321 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51321?
51321 is a semiprime: 3 × 17107, the product of two primes.