The number 51967
51967 is a composite number with 4 divisors. Its prime factorisation is 157 × 331. Divisors (4): 1, 157, 331, 51967.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51967: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 157 × 331, the product of two primes.
- 2
51967 is composite. Its prime factorisation is
- 3
The divisors add up to 52456; without 51967 itself that is 489, so 51967 is deficient (489 is less than 51967). Euler's totient φ(51967) = 51480 numbers up to 51967 share no factor with it.
- 4
The digits of 51967 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51967 = 157 \times 331 \]
51967 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52456 |
| Euler totient φ(n) | 51480 |
| Square | 2700569089 |
| Cube | 140340473848063 |
| Square root | 227.962716 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1967 × |
51967 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand nine hundred and sixty-seven |
| Binary (base 2) | 1100101011111111 |
| Octal (base 8) | 145377 |
| Hexadecimal (base 16) | CAFF |
| Base 3 | 2122021201 |
| As time | 51967 seconds = 14 h 26 min 7 s |
Is 51967 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 2) | 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 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 51967 a prime number?
No. 51967 = 157 × 331, so it is divisible by 157.
What are the factors of 51967?
1, 157, 331, 51967.
What is 51967 in binary?
1100101011111111 (hexadecimal CAFF, octal 145377).
What is the square root of 51967?
About 227.9627.
Is 51967 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 51967?
51967 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 157 × 331, the product of two primes.