The number 51483
51483 is a composite number with 6 divisors. Its prime factorisation is 3 Ć . Divisors (6): 1, 3, 131, 393, 17161, 51483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51483 is composite. Its prime factorisation is
- 3
The divisors add up to 69172; without 51483 itself that is 17689, so 51483 is deficient (17689 is less than 51483). Euler's totient Ļ(51483) = 34060 numbers up to 51483 share no factor with it.
- 4
The digits of 51483 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51483 = 3 \times 131^{2} \]51483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 69172 |
| Euler totient Ļ(n) | 34060 |
| Square | 2650499289 |
| Cube | 136455654895587 |
| Square root | 226.898656 (= 131ā3) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.1483 Ć |
51483 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and eighty-three |
| Binary (base 2) | 1100100100011011 |
| Octal (base 8) | 144433 |
| Hexadecimal (base 16) | C91B |
| Base 3 | 2121121210 |
| As time | 51483 seconds = 14 h 18 min 3 s |
Is 51483 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51483 Ć· 3 = 17161) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51483 a prime number?
No. 51483 = 3 Ć , so it is divisible by 3.
What are the factors of 51483?
1, 3, 131, 393, 17161, 51483.
What is 51483 in binary?
1100100100011011 (hexadecimal C91B, octal 144433).
What is the square root of 51483?
About 226.8987, exactly 131ā3.
Is 51483 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51483?
It is a composite number with 6 divisors.