The number 51555
51555 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 491. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 105, 491, 1473, 2455, 3437, 7365, 10311, 17185, 51555.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51555: a Harshad number: divisible by its digit sum 21.
- 2
51555 is composite. Its prime factorisation is
- 3
The divisors add up to 94464; without 51555 itself that is 42909, so 51555 is deficient (42909 is less than 51555). Euler's totient φ(51555) = 23520 numbers up to 51555 share no factor with it.
- 4
The digits of 51555 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51555 = 3 \times 5 \times 7 \times 491 \]
51555 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 94464 |
| Euler totient φ(n) | 23520 |
| Square | 2657918025 |
| Cube | 137028963778875 |
| Square root | 227.057262 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1555 × |
51555 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and fifty-five |
| Binary (base 2) | 1100100101100011 |
| Octal (base 8) | 144543 |
| Hexadecimal (base 16) | C963 |
| Base 3 | 2121201110 |
| As time | 51555 seconds = 14 h 19 min 15 s |
Is 51555 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 (51555 ÷ 3 = 17185) | 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 | Yes (51555 ÷ 5 = 10311) | 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 | Yes (51555 ÷ 7 = 7365) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 51555 a prime number?
No. 51555 = 3 × 5 × 7 × 491, so it is divisible by 3.
What are the factors of 51555?
1, 3, 5, 7, 15, 21, 35, 105, 491, 1473, 2455, 3437, 7365, 10311, 17185, 51555.
What is 51555 in binary?
1100100101100011 (hexadecimal C963, octal 144543).
What is the square root of 51555?
About 227.0573.
Is 51555 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51555?
51555 is a Harshad number: divisible by its digit sum 21.