Recognised as Number
-50,211
- Negative
- Odd
- 5 digits
-50,211 is an odd 5-digit integer and the negative of 50,211. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value50,211
Digit count5
Digit sum9
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 7 × 797
Distinct prime factors33, 7, 797
Number of divisors12
Sum of divisors σ(n)82,992
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 63, 797, 2,391, 5,579, 7,173, 16,737, 50,21112 in total
Arithmetic
Representations
Decimal-50,211
Binary110001000010001116 bits
Octal142043
HexadecimalC423
Base 3612QR
In wordsminus fifty thousand, two hundred and eleven
Ordinalminus fifty thousand, two hundred and eleventh
Scientific notation-5.0211 × 10^4
Engineering notation-50.211 × 10^3
In other bases
Ternary2112212200base 3; the most digit-efficient integer base after e: 10 digits
Quinary3101321base 5; one hand: 7 digits
Septenary266250base 7: 6 digits
Nonary75780base 9; each digit is two ternary digits: 5 digits
Duodecimal25083base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal65abbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal13:56:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0110010100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110100110000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110011101111011101
Bit length16 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits10within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2c4 23
Gray code1010011000110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110011101111011101two's complement
64-bit1111111111111111111111111111111111111111111111110011101111011101two's complement
One's complement00000000000000001100010000100010at 32 bits, every bit flipped
Bits reversed10111011110111001111111111111111at 32 bits
Rotated left by 111111111111111100111011110111011at 32 bits, wrapping
Shifted left by 1-11000100001000110= -100,422, no wrap
Shifted right by 1-110001000010010= -25,105, discarding the low bit
These bits as a double2.48075301 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-50,211 to the power 22,521,144,521
-50,211 to the power 3-126,589,187,543,931
-50,211 to the power 46,356,169,695,768,319,441
-50,211 to the power 5-319,149,636,594,223,087,452,051
First ten multiples-50,211, -100,422, -150,633, -200,844, -251,055, -301,266, -351,477, -401,688, -451,899, -502,110
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-5,021,100%
-50,211% as a decimal-502.11
-50,211% of 100-50,211
-50,211% of 1,000-502,110
As a fraction of 100-50,211/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -50,211
Nerdulate something else
Nothing in mind? Surprise me · today’s page