Recognised as Number
-2,011
- Negative
- Odd
- 4 digits
-2,011 is an odd 4-digit integer and the negative of 2,011. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value2,011
Digit count4
Digit sum4
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2,011
Distinct prime factors12,011
Number of divisors2
Sum of divisors σ(n)2,012
SquarefreeYesno repeated prime factor
All divisors1, 2,0112 in total
Arithmetic
Representations
Decimal-2,011
Binary1111101101111 bits
Octal3733
Hexadecimal7DB
Base 361JV
In wordsminus two thousand and eleven
Ordinalminus two thousand and eleventh
Scientific notation-2.011 × 10^3
Engineering notation-2.011 × 10^3
In other bases
Ternary2202111base 3; the most digit-efficient integer base after e: 7 digits
Quinary31021base 5; one hand: 5 digits
Septenary5602base 7: 4 digits
Nonary2674base 9; each digit is two ternary digits: 4 digits
Duodecimal11b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal50bbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal33:31base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT01T1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111100000100101
Bit length11 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits2within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 10worth 1,024
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes207 db
Gray code10000110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111100000100101two's complement
32-bit11111111111111111111100000100101two's complement
64-bit1111111111111111111111111111111111111111111111111111100000100101two's complement
One's complement0000011111011010at 16 bits, every bit flipped
Bits reversed1010010000011111at 16 bits
Rotated left by 11111000001001011at 16 bits, wrapping
Shifted left by 1-111110110110= -4,022, no wrap
Shifted right by 1-1111101110= -1,005, discarding the low bit
These bits as a double9.93566014 × 10^-321≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,011 to the power 24,044,121
-2,011 to the power 3-8,132,727,331
-2,011 to the power 416,354,914,662,641
-2,011 to the power 5-32,889,733,386,571,051
First ten multiples-2,011, -4,022, -6,033, -8,044, -10,055, -12,066, -14,077, -16,088, -18,099, -20,110
Powers of twoBetween 2^10 (1,024) and 2^11 (2,048)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-201,100%
-2,011% as a decimal-20.11
-2,011% of 100-2,011
-2,011% of 1,000-20,110
As a fraction of 100-2,011/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,011
Nerdulate something else
Nothing in mind? Surprise me · today’s page