The number 51146
51146 is a composite number with 8 divisors. Its prime factorisation is 2 × 107 × 239. Divisors (8): 1, 2, 107, 214, 239, 478, 25573, 51146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51146: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51146 is composite. Its prime factorisation is
- 3
The divisors add up to 77760; without 51146 itself that is 26614, so 51146 is deficient (26614 is less than 51146). Euler's totient φ(51146) = 25228 numbers up to 51146 share no factor with it.
- 4
The digits of 51146 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51146 = 2 \times 107 \times 239 \]
51146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77760 |
| Euler totient φ(n) | 25228 |
| Square | 2615913316 |
| Cube | 133793502460136 |
| Square root | 226.154814 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1146 × |
51146 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and forty-six |
| Binary (base 2) | 1100011111001010 |
| Octal (base 8) | 143712 |
| Hexadecimal (base 16) | C7CA |
| Base 3 | 2121011022 |
| As time | 51146 seconds = 14 h 12 min 26 s |
Is 51146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51146 ÷ 2 = 25573) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51146 a prime number?
No. 51146 = 2 × 107 × 239, so it is divisible by 2.
What are the factors of 51146?
1, 2, 107, 214, 239, 478, 25573, 51146.
What is 51146 in binary?
1100011111001010 (hexadecimal C7CA, octal 143712).
What is the square root of 51146?
About 226.1548.
Is 51146 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51146?
51146 is a happy number: repeatedly adding the squares of its digits reaches 1.