The number 51006
51006 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8501. Divisors (8): 1, 2, 3, 6, 8501, 17002, 25503, 51006.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51006 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51006 is composite. Its prime factorisation is
- 3
The divisors add up to 102024; without 51006 itself that is 51018, so 51006 is abundant (51018 is more than 51006). Euler's totient φ(51006) = 17000 numbers up to 51006 share no factor with it.
- 4
The digits of 51006 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 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51006 = 2 \times 3 \times 8501 \]
51006 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 102024 |
| Euler totient φ(n) | 17000 |
| Square | 2601612036 |
| Cube | 132697823508216 |
| Square root | 225.845080 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1006 × |
51006 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and six |
| Binary (base 2) | 1100011100111110 |
| Octal (base 8) | 143476 |
| Hexadecimal (base 16) | C73E |
| Base 3 | 2120222010 |
| As time | 51006 seconds = 14 h 10 min 6 s |
Is 51006 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51006 ÷ 2 = 25503) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51006 ÷ 3 = 17002) | 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 (51006 ÷ 6 = 8501) | 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 6) | 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 6) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51006 a prime number?
No. 51006 = 2 × 3 × 8501, so it is divisible by 2.
What are the factors of 51006?
1, 2, 3, 6, 8501, 17002, 25503, 51006.
What is 51006 in binary?
1100011100111110 (hexadecimal C73E, octal 143476).
What is the square root of 51006?
About 225.8451.
Is 51006 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 51006?
It is a composite number with 8 divisors.