The number 51209
51209 is a composite number with 4 divisors. Its prime factorisation is 41 × 1249. Divisors (4): 1, 41, 1249, 51209.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51209: a semiprime: 41 × 1249, the product of two primes.
- 2
51209 is composite. Its prime factorisation is
- 3
The divisors add up to 52500; without 51209 itself that is 1291, so 51209 is deficient (1291 is less than 51209). Euler's totient φ(51209) = 49920 numbers up to 51209 share no factor with it.
- 4
The digits of 51209 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51209 = 41 \times 1249 \]
51209 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52500 |
| Euler totient φ(n) | 49920 |
| Square | 2622361681 |
| Cube | 134288519322329 |
| Square root | 226.294056 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.1209 × |
51209 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and nine |
| Binary (base 2) | 1100100000001001 |
| Octal (base 8) | 144011 |
| Hexadecimal (base 16) | C809 |
| Base 3 | 2121020122 |
| As time | 51209 seconds = 14 h 13 min 29 s |
Is 51209 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 | No (remainder 2) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51209 a prime number?
No. 51209 = 41 × 1249, so it is divisible by 41.
What are the factors of 51209?
1, 41, 1249, 51209.
What is 51209 in binary?
1100100000001001 (hexadecimal C809, octal 144011).
What is the square root of 51209?
About 226.2941.
Is 51209 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51209?
51209 is a semiprime: 41 × 1249, the product of two primes.