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