The number 51951
51951 is a composite number with 4 divisors. Its prime factorisation is 3 × 17317. Divisors (4): 1, 3, 17317, 51951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51951: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 17317, the product of two primes.
- 2
51951 is composite. Its prime factorisation is
- 3
The divisors add up to 69272; without 51951 itself that is 17321, so 51951 is deficient (17321 is less than 51951). Euler's totient φ(51951) = 34632 numbers up to 51951 share no factor with it.
- 4
The digits of 51951 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51951 = 3 \times 17317 \]
51951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 69272 |
| Euler totient φ(n) | 34632 |
| Square | 2698906401 |
| Cube | 140210886438351 |
| Square root | 227.927620 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1951 × |
51951 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand nine hundred and fifty-one |
| Binary (base 2) | 1100101011101111 |
| Octal (base 8) | 145357 |
| Hexadecimal (base 16) | CAEF |
| Base 3 | 2122021010 |
| As time | 51951 seconds = 14 h 25 min 51 s |
Is 51951 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 (51951 ÷ 3 = 17317) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51951 a prime number?
No. 51951 = 3 × 17317, so it is divisible by 3.
What are the factors of 51951?
1, 3, 17317, 51951.
What is 51951 in binary?
1100101011101111 (hexadecimal CAEF, octal 145357).
What is the square root of 51951?
About 227.9276.
Is 51951 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51951?
51951 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 17317, the product of two primes.