The number 85481
85481 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 409. Divisors (8): 1, 11, 19, 209, 409, 4499, 7771, 85481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
85481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
85481 is composite. Its prime factorisation is
- 3
The divisors add up to 98400; without 85481 itself that is 12919, so 85481 is deficient (12919 is less than 85481). Euler's totient φ(85481) = 73440 numbers up to 85481 share no factor with it.
- 4
The digits of 85481 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 85481 = 11 \times 19 \times 409 \]
85481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 98400 |
| Euler totient φ(n) | 73440 |
| Square | 7307001361 |
| Cube | 624609783339641 |
| Square root | 292.371339 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 182 |
| Scientific notation | 8.5481 × |
85481 in other forms
| Form | Value |
|---|---|
| In words | eighty-five thousand four hundred and eighty-one |
| Binary (base 2) | 10100110111101001 |
| Octal (base 8) | 246751 |
| Hexadecimal (base 16) | 14DE9 |
| Base 3 | 11100020222 |
| As time | 85481 seconds = 23 h 44 min 41 s |
Is 85481 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | 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 | Yes (85481 ÷ 11 = 7771) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 85481 a prime number?
No. 85481 = 11 × 19 × 409, so it is divisible by 11.
What are the factors of 85481?
1, 11, 19, 209, 409, 4499, 7771, 85481.
What is 85481 in binary?
10100110111101001 (hexadecimal 14DE9, octal 246751).
What is the square root of 85481?
About 292.3713.
Is 85481 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 85481?
It is a composite number with 8 divisors.