The number 51906
51906 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 41 × 211. Divisors (16): 1, 2, 3, 6, 41, 82, 123, 211, 246, 422, 633, 1266, 8651, 17302, 25953, 51906.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51906 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51906 is composite. Its prime factorisation is
- 3
The divisors add up to 106848; without 51906 itself that is 54942, so 51906 is abundant (54942 is more than 51906). Euler's totient φ(51906) = 16800 numbers up to 51906 share no factor with it.
- 4
The digits of 51906 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51906 = 2 \times 3 \times 41 \times 211 \]
51906 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 106848 |
| Euler totient φ(n) | 16800 |
| Square | 2694232836 |
| Cube | 139846849585416 |
| Square root | 227.828883 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1906 × |
51906 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand nine hundred and six |
| Binary (base 2) | 1100101011000010 |
| Octal (base 8) | 145302 |
| Hexadecimal (base 16) | CAC2 |
| Base 3 | 2122012110 |
| As time | 51906 seconds = 14 h 25 min 6 s |
Is 51906 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51906 ÷ 2 = 25953) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51906 ÷ 3 = 17302) | 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 (51906 ÷ 6 = 8651) | 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 2) | 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 8) | 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 51906 a prime number?
No. 51906 = 2 × 3 × 41 × 211, so it is divisible by 2.
What are the factors of 51906?
1, 2, 3, 6, 41, 82, 123, 211, 246, 422, 633, 1266, 8651, 17302, 25953, 51906.
What is 51906 in binary?
1100101011000010 (hexadecimal CAC2, octal 145302).
What is the square root of 51906?
About 227.8289.
Is 51906 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51906?
It is a composite number with 16 divisors.