The number 51406
51406 is a composite number with 4 divisors. Its prime factorisation is 2 × 25703. Divisors (4): 1, 2, 25703, 51406.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51406: a semiprime: 2 × 25703, the product of two primes.
- 2
51406 is composite. Its prime factorisation is
- 3
The divisors add up to 77112; without 51406 itself that is 25706, so 51406 is deficient (25706 is less than 51406). Euler's totient φ(51406) = 25702 numbers up to 51406 share no factor with it.
- 4
The digits of 51406 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51406 = 2 \times 25703 \]
51406 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 77112 |
| Euler totient φ(n) | 25702 |
| Square | 2642576836 |
| Cube | 135844304831416 |
| Square root | 226.728913 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.1406 × |
51406 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and six |
| Binary (base 2) | 1100100011001110 |
| Octal (base 8) | 144316 |
| Hexadecimal (base 16) | C8CE |
| Base 3 | 2121111221 |
| As time | 51406 seconds = 14 h 16 min 46 s |
Is 51406 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51406 ÷ 2 = 25703) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51406 a prime number?
No. 51406 = 2 × 25703, so it is divisible by 2.
What are the factors of 51406?
1, 2, 25703, 51406.
What is 51406 in binary?
1100100011001110 (hexadecimal C8CE, octal 144316).
What is the square root of 51406?
About 226.7289.
Is 51406 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51406?
51406 is a semiprime: 2 × 25703, the product of two primes.