The number 11999
11999 is a composite number with 6 divisors. Its prime factorisation is Ć 71. Divisors (6): 1, 13, 71, 169, 923, 11999.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11999 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11999 is composite. Its prime factorisation is
- 3
The divisors add up to 13176; without 11999 itself that is 1177, so 11999 is deficient (1177 is less than 11999). Euler's totient Ļ(11999) = 10920 numbers up to 11999 share no factor with it.
- 4
The digits of 11999 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 187 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11999 = 13^{2} \times 71 \]11999 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 13176 |
| Euler totient Ļ(n) | 10920 |
| Square | 143976001 |
| Cube | 1727568035999 |
| Square root | 109.539947 (= 13ā71) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 187 |
| Scientific notation | 1.1999 Ć |
11999 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand nine hundred and ninety-nine |
| Binary (base 2) | 10111011011111 |
| Octal (base 8) | 27337 |
| Hexadecimal (base 16) | 2EDF |
| Base 3 | 121110102 |
| As time | 11999 seconds = 3 h 19 min 59 s |
Is 11999 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11999 a prime number?
No. 11999 = Ć 71, so it is divisible by 13.
What are the factors of 11999?
1, 13, 71, 169, 923, 11999.
What is 11999 in binary?
10111011011111 (hexadecimal 2EDF, octal 27337).
What is the square root of 11999?
About 109.5399, exactly 13ā71.
Is 11999 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 11999?
It is a composite number with 6 divisors.