The number 8481
8481 is a binary palindrome (10000100100001). Its prime factorisation is 3 × 11 × 257. Divisors (8): 1, 3, 11, 33, 257, 771, 2827, 8481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8481: a binary palindrome (10000100100001).
- 2
8481 is composite. Its prime factorisation is
- 3
The divisors add up to 12384; without 8481 itself that is 3903, so 8481 is deficient (3903 is less than 8481). Euler's totient φ(8481) = 5120 numbers up to 8481 share no factor with it.
- 4
The digits of 8481 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8481 = 3 \times 11 \times 257 \]
8481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 12384 |
| Euler totient φ(n) | 5120 |
| Square | 71927361 |
| Cube | 610015948641 |
| Square root | 92.092345 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 109 |
| Scientific notation | 8.481 × |
8481 in other forms
| Form | Value |
|---|---|
| In words | eight thousand four hundred and eighty-one |
| Binary (base 2) | 10000100100001 |
| Octal (base 8) | 20441 |
| Hexadecimal (base 16) | 2121 |
| Base 3 | 102122010 |
| As time | 8481 seconds = 2 h 21 min 21 s |
Is 8481 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 (8481 ÷ 3 = 2827) | 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 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 3) | 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 (8481 ÷ 11 = 771) | 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 8481 a prime number?
No. 8481 = 3 × 11 × 257, so it is divisible by 3.
What are the factors of 8481?
1, 3, 11, 33, 257, 771, 2827, 8481.
What is 8481 in binary?
10000100100001 (hexadecimal 2121, octal 20441).
What is the square root of 8481?
About 92.0923.
Is 8481 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 8481?
8481 is a binary palindrome (10000100100001).