The number 81951
81951 is a composite number with 8 divisors. Its prime factorisation is 3 × 59 × 463. Divisors (8): 1, 3, 59, 177, 463, 1389, 27317, 81951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
81951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
81951 is composite. Its prime factorisation is
- 3
The divisors add up to 111360; without 81951 itself that is 29409, so 81951 is deficient (29409 is less than 81951). Euler's totient φ(81951) = 53592 numbers up to 81951 share no factor with it.
- 4
The digits of 81951 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 81951 = 3 \times 59 \times 463 \]
81951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 111360 |
| Euler totient φ(n) | 53592 |
| Square | 6715966401 |
| Cube | 550380162528351 |
| Square root | 286.270851 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 107 |
| Scientific notation | 8.1951 × |
81951 in other forms
| Form | Value |
|---|---|
| In words | eighty-one thousand nine hundred and fifty-one |
| Binary (base 2) | 10100000000011111 |
| Octal (base 8) | 240037 |
| Hexadecimal (base 16) | 1401F |
| Base 3 | 11011102020 |
| As time | 81951 seconds = 22 h 45 min 51 s |
Is 81951 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 (81951 ÷ 3 = 27317) | 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 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 7) | 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 1) | 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 81951 a prime number?
No. 81951 = 3 × 59 × 463, so it is divisible by 3.
What are the factors of 81951?
1, 3, 59, 177, 463, 1389, 27317, 81951.
What is 81951 in binary?
10100000000011111 (hexadecimal 1401F, octal 240037).
What is the square root of 81951?
About 286.2709.
Is 81951 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 81951?
It is a composite number with 8 divisors.