The number 51909
51909 is a composite number with 16 divisors. Its prime factorisation is 3 × × 13. Divisors (16): 1, 3, 11, 13, 33, 39, 121, 143, 363, 429, 1331, 1573, 3993, 4719, 17303, 51909.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51909: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51909 is composite. Its prime factorisation is
- 3
The divisors add up to 81984; without 51909 itself that is 30075, so 51909 is deficient (30075 is less than 51909). Euler's totient φ(51909) = 29040 numbers up to 51909 share no factor with it.
- 4
The digits of 51909 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51909 = 3 \times 11^{3} \times 13 \]51909 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 81984 |
| Euler totient φ(n) | 29040 |
| Square | 2694544281 |
| Cube | 139871099082429 |
| Square root | 227.835467 (= 11√429) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.1909 × |
51909 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand nine hundred and nine |
| Binary (base 2) | 1100101011000101 |
| Octal (base 8) | 145305 |
| Hexadecimal (base 16) | CAC5 |
| Base 3 | 2122012120 |
| As time | 51909 seconds = 14 h 25 min 9 s |
Is 51909 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 (51909 ÷ 3 = 17303) | 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 | No (remainder 4) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51909 ÷ 11 = 4719) | 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 51909 a prime number?
No. 51909 = 3 × × 13, so it is divisible by 3.
What are the factors of 51909?
1, 3, 11, 13, 33, 39, 121, 143, 363, 429, 1331, 1573, 3993, 4719, 17303, 51909.
What is 51909 in binary?
1100101011000101 (hexadecimal CAC5, octal 145305).
What is the square root of 51909?
About 227.8355, exactly 11√429.
Is 51909 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 51909?
51909 is a happy number: repeatedly adding the squares of its digits reaches 1.