The number 51642
51642 is a composite number with 24 divisors. Its prime factorisation is 2 × × 19 × 151. Divisors (24): 1, 2, 3, 6, 9, 18, 19, 38, 57, 114, 151, 171, 302, 342, 453, 906 … 51642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51642: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
51642 is composite. Its prime factorisation is
- 3
The divisors add up to 118560; without 51642 itself that is 66918, so 51642 is abundant (66918 is more than 51642). Euler's totient φ(51642) = 16200 numbers up to 51642 share no factor with it.
- 4
The digits of 51642 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51642 = 2 \times 3^{2} \times 19 \times 151 \]51642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 118560 |
| Euler totient φ(n) | 16200 |
| Square | 2666896164 |
| Cube | 137723851701288 |
| Square root | 227.248762 (= 3√5738) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.1642 × |
51642 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and forty-two |
| Binary (base 2) | 1100100110111010 |
| Octal (base 8) | 144672 |
| Hexadecimal (base 16) | C9BA |
| Base 3 | 2121211200 |
| As time | 51642 seconds = 14 h 20 min 42 s |
Is 51642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51642 ÷ 2 = 25821) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51642 ÷ 3 = 17214) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51642 ÷ 6 = 8607) | 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 | Yes (51642 ÷ 9 = 5738) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 51642 a prime number?
No. 51642 = 2 × × 19 × 151, so it is divisible by 2.
What are the factors of 51642?
1, 2, 3, 6, 9, 18, 19, 38, 57, 114, 151, 171, 302, 342, 453, 906, 1359, 2718, 2869, 5738, 8607, 17214, 25821, 51642.
What is 51642 in binary?
1100100110111010 (hexadecimal C9BA, octal 144672).
What is the square root of 51642?
About 227.2488, exactly 3√5738.
Is 51642 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51642?
51642 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.