The number 51351
51351 is a composite number with 4 divisors. Its prime factorisation is 3 × 17117. Divisors (4): 1, 3, 17117, 51351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51351: a semiprime: 3 × 17117, the product of two primes.
- 2
51351 is composite. Its prime factorisation is
- 3
The divisors add up to 68472; without 51351 itself that is 17121, so 51351 is deficient (17121 is less than 51351). Euler's totient φ(51351) = 34232 numbers up to 51351 share no factor with it.
- 4
The digits of 51351 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51351 = 3 \times 17117 \]
51351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68472 |
| Euler totient φ(n) | 34232 |
| Square | 2636925201 |
| Cube | 135408745996551 |
| Square root | 226.607590 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1351 × |
51351 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and fifty-one |
| Binary (base 2) | 1100100010010111 |
| Octal (base 8) | 144227 |
| Hexadecimal (base 16) | C897 |
| Base 3 | 2121102220 |
| As time | 51351 seconds = 14 h 15 min 51 s |
Is 51351 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 (51351 ÷ 3 = 17117) | 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 | 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 6) | 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 6) | 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 3) | 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 51351 a prime number?
No. 51351 = 3 × 17117, so it is divisible by 3.
What are the factors of 51351?
1, 3, 17117, 51351.
What is 51351 in binary?
1100100010010111 (hexadecimal C897, octal 144227).
What is the square root of 51351?
About 226.6076.
Is 51351 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51351?
51351 is a semiprime: 3 × 17117, the product of two primes.