Recognised as Number
-6,011
- Negative
- Odd
- 4 digits
-6,011 is an odd 4-digit integer and the negative of 6,011. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value6,011
Digit count4
Digit sum8
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 6,011
Distinct prime factors16,011
Number of divisors2
Sum of divisors σ(n)6,012
SquarefreeYesno repeated prime factor
All divisors1, 6,0112 in total
Arithmetic
Previous number-6,012
Next number-6,010
Double-12,022
Half-3,005.5
Square36,132,121
Cube-217,190,179,331
Cube root-18.182303775≈
Negation6,011
Reciprocal-0.0001663617≈
Representations
Decimal-6,011
Binary101110111101113 bits
Octal13573
Hexadecimal177B
Base 364MZ
In wordsminus six thousand and eleven
Ordinalminus six thousand and eleventh
Scientific notation-6.011 × 10^3
Engineering notation-6.011 × 10^3
In other bases
Ternary22020122base 3; the most digit-efficient integer base after e: 8 digits
Quinary143021base 5; one hand: 6 digits
Septenary23345base 7: 5 digits
Nonary8218base 9; each digit is two ternary digits: 4 digits
Duodecimal358bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalf0bbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:40:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01T1T101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110100010000101
Bit length13 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits3within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes217 7b
Gray code1110011000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110100010000101two's complement
32-bit11111111111111111110100010000101two's complement
64-bit1111111111111111111111111111111111111111111111111110100010000101two's complement
One's complement0001011101111010at 16 bits, every bit flipped
Bits reversed1010000100010111at 16 bits
Rotated left by 11101000100001011at 16 bits, wrapping
Shifted left by 1-10111011110110= -12,022, no wrap
Shifted right by 1-101110111110= -3,005, discarding the low bit
These bits as a double2.9698286 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-6,011 to the power 236,132,121
-6,011 to the power 3-217,190,179,331
-6,011 to the power 41,305,530,167,958,641
-6,011 to the power 5-7,847,541,839,599,391,051
First ten multiples-6,011, -12,022, -18,033, -24,044, -30,055, -36,066, -42,077, -48,088, -54,099, -60,110
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-601,100%
-6,011% as a decimal-60.11
-6,011% of 100-6,011
-6,011% of 1,000-60,110
As a fraction of 100-6,011/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -6,011
Nerdulate something else
Nothing in mind? Surprise me · today’s page