Recognised as Number
-5,011
- Negative
- Odd
- 4 digits
-5,011 is an odd 4-digit integer and the negative of 5,011. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value5,011
Digit count4
Digit sum7
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5,011
Distinct prime factors15,011
Number of divisors2
Sum of divisors σ(n)5,012
SquarefreeYesno repeated prime factor
All divisors1, 5,0112 in total
Arithmetic
Previous number-5,012
Next number-5,010
Double-10,022
Half-2,505.5
Square25,110,121
Cube-125,826,816,331
Cube root-17.112290106≈
Negation5,011
Reciprocal-0.000199561≈
Representations
Decimal-5,011
Binary100111001001113 bits
Octal11623
Hexadecimal1393
Base 363V7
In wordsminus five thousand and eleven
Ordinalminus five thousand and eleventh
Scientific notation-5.011 × 10^3
Engineering notation-5.011 × 10^3
In other bases
Ternary20212121base 3; the most digit-efficient integer base after e: 8 digits
Quinary130021base 5; one hand: 6 digits
Septenary20416base 7: 5 digits
Nonary6777base 9; each digit is two ternary digits: 4 digits
Duodecimal2a97base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalcabbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:23:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T01011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110110111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110110001101101
Bit length13 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits6within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes213 93
Gray code1101001011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110110001101101two's complement
32-bit11111111111111111110110001101101two's complement
64-bit1111111111111111111111111111111111111111111111111110110001101101two's complement
One's complement0001001110010010at 16 bits, every bit flipped
Bits reversed1011011000110111at 16 bits
Rotated left by 11101100011011011at 16 bits, wrapping
Shifted left by 1-10011100100110= -10,022, no wrap
Shifted right by 1-100111001010= -2,505, discarding the low bit
These bits as a double2.47576295 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-5,011 to the power 225,110,121
-5,011 to the power 3-125,826,816,331
-5,011 to the power 4630,518,176,634,641
-5,011 to the power 5-3,159,526,583,116,186,051
First ten multiples-5,011, -10,022, -15,033, -20,044, -25,055, -30,066, -35,077, -40,088, -45,099, -50,110
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
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 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-501,100%
-5,011% as a decimal-50.11
-5,011% of 100-5,011
-5,011% of 1,000-50,110
As a fraction of 100-5,011/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -5,011
Nerdulate something else
Nothing in mind? Surprise me · today’s page