The number 51496
51496 is a composite number with 16 divisors. Its prime factorisation is × 41 × 157. Divisors (16): 1, 2, 4, 8, 41, 82, 157, 164, 314, 328, 628, 1256, 6437, 12874, 25748, 51496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51496 is composite. Its prime factorisation is
- 3
The divisors add up to 99540; without 51496 itself that is 48044, so 51496 is deficient (48044 is less than 51496). Euler's totient φ(51496) = 24960 numbers up to 51496 share no factor with it.
- 4
The digits of 51496 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51496 = 2^{3} \times 41 \times 157 \]51496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 99540 |
| Euler totient φ(n) | 24960 |
| Square | 2651838016 |
| Cube | 136559050471936 |
| Square root | 226.927301 (= 2√12874) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1496 × |
51496 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and ninety-six |
| Binary (base 2) | 1100100100101000 |
| Octal (base 8) | 144450 |
| Hexadecimal (base 16) | C928 |
| Base 3 | 2121122021 |
| As time | 51496 seconds = 14 h 18 min 16 s |
Is 51496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51496 ÷ 2 = 25748) | 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 | Yes (51496 ÷ 4 = 12874) | 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 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 | Yes (51496 ÷ 8 = 6437) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51496 a prime number?
No. 51496 = × 41 × 157, so it is divisible by 2.
What are the factors of 51496?
1, 2, 4, 8, 41, 82, 157, 164, 314, 328, 628, 1256, 6437, 12874, 25748, 51496.
What is 51496 in binary?
1100100100101000 (hexadecimal C928, octal 144450).
What is the square root of 51496?
About 226.9273, exactly 2√12874.
Is 51496 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 51496?
It is a composite number with 16 divisors.