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