The number 51405
51405 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 23 × 149. Divisors (16): 1, 3, 5, 15, 23, 69, 115, 149, 345, 447, 745, 2235, 3427, 10281, 17135, 51405.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51405: a Harshad number: divisible by its digit sum 15.
- 2
51405 is composite. Its prime factorisation is
- 3
The divisors add up to 86400; without 51405 itself that is 34995, so 51405 is deficient (34995 is less than 51405). Euler's totient φ(51405) = 26048 numbers up to 51405 share no factor with it.
- 4
The digits of 51405 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51405 = 3 \times 5 \times 23 \times 149 \]
51405 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 86400 |
| Euler totient φ(n) | 26048 |
| Square | 2642474025 |
| Cube | 135836377255125 |
| Square root | 226.726708 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1405 × |
51405 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and five |
| Binary (base 2) | 1100100011001101 |
| Octal (base 8) | 144315 |
| Hexadecimal (base 16) | C8CD |
| Base 3 | 2121111220 |
| As time | 51405 seconds = 14 h 16 min 45 s |
Is 51405 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 (51405 ÷ 3 = 17135) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51405 ÷ 5 = 10281) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51405 a prime number?
No. 51405 = 3 × 5 × 23 × 149, so it is divisible by 3.
What are the factors of 51405?
1, 3, 5, 15, 23, 69, 115, 149, 345, 447, 745, 2235, 3427, 10281, 17135, 51405.
What is 51405 in binary?
1100100011001101 (hexadecimal C8CD, octal 144315).
What is the square root of 51405?
About 226.7267.
Is 51405 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51405?
51405 is a Harshad number: divisible by its digit sum 15.