The number 51159
51159 is a composite number with 4 divisors. Its prime factorisation is 3 × 17053. Divisors (4): 1, 3, 17053, 51159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51159: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 17053, the product of two primes.
- 2
51159 is composite. Its prime factorisation is
- 3
The divisors add up to 68216; without 51159 itself that is 17057, so 51159 is deficient (17057 is less than 51159). Euler's totient φ(51159) = 34104 numbers up to 51159 share no factor with it.
- 4
The digits of 51159 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
\[ 51159 = 3 \times 17053 \]
51159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68216 |
| Euler totient φ(n) | 34104 |
| Square | 2617243281 |
| Cube | 133895549012679 |
| Square root | 226.183554 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1159 × |
51159 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and fifty-nine |
| Binary (base 2) | 1100011111010111 |
| Octal (base 8) | 143727 |
| Hexadecimal (base 16) | C7D7 |
| Base 3 | 2121011210 |
| As time | 51159 seconds = 14 h 12 min 39 s |
Is 51159 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 (51159 ÷ 3 = 17053) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 9) | 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 51159 a prime number?
No. 51159 = 3 × 17053, so it is divisible by 3.
What are the factors of 51159?
1, 3, 17053, 51159.
What is 51159 in binary?
1100011111010111 (hexadecimal C7D7, octal 143727).
What is the square root of 51159?
About 226.1836.
Is 51159 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51159?
51159 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 17053, the product of two primes.