Recognised as Number
-11,589
- Negative
- Odd
- 5 digits
-11,589 is an odd 5-digit integer and the negative of 11,589. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value11,589
Digit count5
Digit sum24
Digit product360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 3,863
Distinct prime factors23, 3,863
Number of divisors4
Sum of divisors σ(n)15,456
SquarefreeYesno repeated prime factor
All divisors1, 3, 3,863, 11,5894 in total
Arithmetic
Representations
Decimal-11,589
Binary1011010100010114 bits
Octal26505
Hexadecimal2D45
Base 368XX
In wordsminus eleven thousand, five hundred and eighty-nine
Ordinalminus eleven thousand, five hundred and eighty-ninth
Scientific notation-1.1589 × 10^4
Engineering notation-11.589 × 10^3
In other bases
Ternary120220020base 3; the most digit-efficient integer base after e: 9 digits
Quinary332324base 5; one hand: 6 digits
Septenary45534base 7: 5 digits
Nonary16806base 9; each digit is two ternary digits: 5 digits
Duodecimal6859base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal18j9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:13:9base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T010T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011111001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101001010111011
Bit length14 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits7within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes22d 45
Gray code11101111100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101001010111011two's complement
32-bit11111111111111111101001010111011two's complement
64-bit1111111111111111111111111111111111111111111111111101001010111011two's complement
One's complement0010110101000100at 16 bits, every bit flipped
Bits reversed1101110101001011at 16 bits
Rotated left by 11010010101110111at 16 bits, wrapping
Shifted left by 1-101101010001010= -23,178, no wrap
Shifted right by 1-1011010100011= -5,794, discarding the low bit
These bits as a double5.72572677 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-11,589 to the power 2134,304,921
-11,589 to the power 3-1,556,459,729,469
-11,589 to the power 418,037,811,804,816,241
-11,589 to the power 5-209,040,201,006,015,416,949
First ten multiples-11,589, -23,178, -34,767, -46,356, -57,945, -69,534, -81,123, -92,712, -104,301, -115,890
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
As a percentage & fraction
As a percentage-1,158,900%
-11,589% as a decimal-115.89
-11,589% of 100-11,589
-11,589% of 1,000-115,890
As a fraction of 100-11,589/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -11,589
Nerdulate something else
Nothing in mind? Surprise me · today’s page