The number 11487
11487 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 547. Divisors (8): 1, 3, 7, 21, 547, 1641, 3829, 11487.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11487: a Harshad number: divisible by its digit sum 21.
- 2
11487 is composite. Its prime factorisation is
- 3
The divisors add up to 17536; without 11487 itself that is 6049, so 11487 is deficient (6049 is less than 11487). Euler's totient φ(11487) = 6552 numbers up to 11487 share no factor with it.
- 4
The digits of 11487 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11487 = 3 \times 7 \times 547 \]
11487 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17536 |
| Euler totient φ(n) | 6552 |
| Square | 131951169 |
| Cube | 1515723078303 |
| Square root | 107.177423 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1487 × |
11487 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and eighty-seven |
| Binary (base 2) | 10110011011111 |
| Octal (base 8) | 26337 |
| Hexadecimal (base 16) | 2CDF |
| Base 3 | 120202110 |
| As time | 11487 seconds = 3 h 11 min 27 s |
Is 11487 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 (11487 ÷ 3 = 3829) | 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 2) | 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 | Yes (11487 ÷ 7 = 1641) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 11487 a prime number?
No. 11487 = 3 × 7 × 547, so it is divisible by 3.
What are the factors of 11487?
1, 3, 7, 21, 547, 1641, 3829, 11487.
What is 11487 in binary?
10110011011111 (hexadecimal 2CDF, octal 26337).
What is the square root of 11487?
About 107.1774.
Is 11487 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 11487?
11487 is a Harshad number: divisible by its digit sum 21.