The number 11481
11481 is a composite number with 8 divisors. Its prime factorisation is 3 × 43 × 89. Divisors (8): 1, 3, 43, 89, 129, 267, 3827, 11481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11481 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11481 is composite. Its prime factorisation is
- 3
The divisors add up to 15840; without 11481 itself that is 4359, so 11481 is deficient (4359 is less than 11481). Euler's totient φ(11481) = 7392 numbers up to 11481 share no factor with it.
- 4
The digits of 11481 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11481 = 3 \times 43 \times 89 \]
11481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15840 |
| Euler totient φ(n) | 7392 |
| Square | 131813361 |
| Cube | 1513349197641 |
| Square root | 107.149428 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1481 × |
11481 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and eighty-one |
| Binary (base 2) | 10110011011001 |
| Octal (base 8) | 26331 |
| Hexadecimal (base 16) | 2CD9 |
| Base 3 | 120202020 |
| As time | 11481 seconds = 3 h 11 min 21 s |
Is 11481 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 (11481 ÷ 3 = 3827) | 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 1) | 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 11481 a prime number?
No. 11481 = 3 × 43 × 89, so it is divisible by 3.
What are the factors of 11481?
1, 3, 43, 89, 129, 267, 3827, 11481.
What is 11481 in binary?
10110011011001 (hexadecimal 2CD9, octal 26331).
What is the square root of 11481?
About 107.1494.
Is 11481 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11481?
It is a composite number with 8 divisors.