The number 51306
51306 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 17 × 503. Divisors (16): 1, 2, 3, 6, 17, 34, 51, 102, 503, 1006, 1509, 3018, 8551, 17102, 25653, 51306.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51306 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51306 is composite. Its prime factorisation is
- 3
The divisors add up to 108864; without 51306 itself that is 57558, so 51306 is abundant (57558 is more than 51306). Euler's totient φ(51306) = 16064 numbers up to 51306 share no factor with it.
- 4
The digits of 51306 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
\[ 51306 = 2 \times 3 \times 17 \times 503 \]
51306 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108864 |
| Euler totient φ(n) | 16064 |
| Square | 2632305636 |
| Cube | 135053072960616 |
| Square root | 226.508278 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1306 × |
51306 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and six |
| Binary (base 2) | 1100100001101010 |
| Octal (base 8) | 144152 |
| Hexadecimal (base 16) | C86A |
| Base 3 | 2121101020 |
| As time | 51306 seconds = 14 h 15 min 6 s |
Is 51306 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51306 ÷ 2 = 25653) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51306 ÷ 3 = 17102) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (51306 ÷ 6 = 8551) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51306 a prime number?
No. 51306 = 2 × 3 × 17 × 503, so it is divisible by 2.
What are the factors of 51306?
1, 2, 3, 6, 17, 34, 51, 102, 503, 1006, 1509, 3018, 8551, 17102, 25653, 51306.
What is 51306 in binary?
1100100001101010 (hexadecimal C86A, octal 144152).
What is the square root of 51306?
About 226.5083.
Is 51306 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51306?
It is a composite number with 16 divisors.