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