The number 81051
81051 is a composite number with 4 divisors. Its prime factorisation is 3 × 27017. Divisors (4): 1, 3, 27017, 81051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 81051: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 27017, the product of two primes.
- 2
81051 is composite. Its prime factorisation is
- 3
The divisors add up to 108072; without 81051 itself that is 27021, so 81051 is deficient (27021 is less than 81051). Euler's totient φ(81051) = 54032 numbers up to 81051 share no factor with it.
- 4
The digits of 81051 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 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81051 = 3 \times 27017 \]
81051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 108072 |
| Euler totient φ(n) | 54032 |
| Square | 6569264601 |
| Cube | 532445465175651 |
| Square root | 284.694573 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.1051 × |
81051 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand and fifty-one |
| Binary (base 2) | 10011110010011011 |
| Octal (base 8) | 236233 |
| Hexadecimal (base 16) | 13C9B |
| Base 3 | 11010011220 |
| As time | 81051 seconds = 22 h 30 min 51 s |
Is 81051 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 (81051 ÷ 3 = 27017) | 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 5) | 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 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 3) | 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 81051 a prime number?
No. 81051 = 3 × 27017, so it is divisible by 3.
What are the factors of 81051?
1, 3, 27017, 81051.
What is 81051 in binary?
10011110010011011 (hexadecimal 13C9B, octal 236233).
What is the square root of 81051?
About 284.6946.
Is 81051 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 81051?
81051 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 27017, the product of two primes.