The number 51409
51409 is a composite number with 4 divisors. Its prime factorisation is 101 × 509. Divisors (4): 1, 101, 509, 51409.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51409: a semiprime: 101 × 509, the product of two primes.
- 2
51409 is composite. Its prime factorisation is
- 3
The divisors add up to 52020; without 51409 itself that is 611, so 51409 is deficient (611 is less than 51409). Euler's totient φ(51409) = 50800 numbers up to 51409 share no factor with it.
- 4
The digits of 51409 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51409 = 101 \times 509 \]
51409 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52020 |
| Euler totient φ(n) | 50800 |
| Square | 2642885281 |
| Cube | 135868089410929 |
| Square root | 226.735529 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.1409 × |
51409 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and nine |
| Binary (base 2) | 1100100011010001 |
| Octal (base 8) | 144321 |
| Hexadecimal (base 16) | C8D1 |
| Base 3 | 2121112001 |
| As time | 51409 seconds = 14 h 16 min 49 s |
Is 51409 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 1) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51409 a prime number?
No. 51409 = 101 × 509, so it is divisible by 101.
What are the factors of 51409?
1, 101, 509, 51409.
What is 51409 in binary?
1100100011010001 (hexadecimal C8D1, octal 144321).
What is the square root of 51409?
About 226.7355.
Is 51409 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51409?
51409 is a semiprime: 101 × 509, the product of two primes.