The number 51246
51246 is a composite number with 32 divisors. Its prime factorisation is 2 × × 13 × 73. Divisors (32): 1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 54, 73, 78, 117, 146, 219 … 51246.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51246: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
51246 is composite. Its prime factorisation is
- 3
The divisors add up to 124320; without 51246 itself that is 73074, so 51246 is abundant (73074 is more than 51246). Euler's totient φ(51246) = 15552 numbers up to 51246 share no factor with it.
- 4
The digits of 51246 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51246 = 2 \times 3^{3} \times 13 \times 73 \]51246 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 124320 |
| Euler totient φ(n) | 15552 |
| Square | 2626152516 |
| Cube | 134579811834936 |
| Square root | 226.375794 (= 3√5694) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1246 × |
51246 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and forty-six |
| Binary (base 2) | 1100100000101110 |
| Octal (base 8) | 144056 |
| Hexadecimal (base 16) | C82E |
| Base 3 | 2121022000 |
| As time | 51246 seconds = 14 h 14 min 6 s |
Is 51246 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51246 ÷ 2 = 25623) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51246 ÷ 3 = 17082) | 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 (51246 ÷ 6 = 8541) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (51246 ÷ 9 = 5694) | 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 51246 a prime number?
No. 51246 = 2 × × 13 × 73, so it is divisible by 2.
What are the factors of 51246?
1, 2, 3, 6, 9, 13, 18, 26, 27, 39, 54, 73, 78, 117, 146, 219, 234, 351, 438, 657, 702, 949, 1314, 1898, 1971, 2847, 3942, 5694, 8541, 17082, 25623, 51246.
What is 51246 in binary?
1100100000101110 (hexadecimal C82E, octal 144056).
What is the square root of 51246?
About 226.3758, exactly 3√5694.
Is 51246 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51246?
51246 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.