Recognised as Number
-213,833
- Negative
- Odd
- 6 digits
-213,833 is an odd 6-digit integer and the negative of 213,833. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value213,833
Digit count6
Digit sum20
Digit product432
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 213,833
Distinct prime factors1213,833
Number of divisors2
Sum of divisors σ(n)213,834
SquarefreeYesno repeated prime factor
All divisors1, 213,8332 in total
Arithmetic
Previous number-213,834
Next number-213,832
Double-427,666
Half-106,916.5
Square45,724,551,889
Cube-9,777,418,104,080,537
Cube root-59.798677092≈
Negation213,833
Reciprocal-0.0000046765≈
Representations
Decimal-213,833
Binary11010000110100100118 bits
Octal641511
Hexadecimal34349
Base 364KZT
In wordsminus two hundred and thirteen thousand, eight hundred and thirty-three
Ordinalminus two hundred and thirteen thousand, eight hundred and thirty-third
Scientific notation-2.13833 × 10^5
Engineering notation-213.833 × 10^3
In other bases
Ternary101212022202base 3; the most digit-efficient integer base after e: 12 digits
Quinary23320313base 5; one hand: 8 digits
Septenary1550264base 7: 7 digits
Nonary355282base 9; each digit is two ternary digits: 6 digits
Duodecimala38b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal16ebdbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal59:23:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT1011T001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100110111001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001011110010110111
Bit length18 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits10within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes303 43 49
Gray code101110001011101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001011110010110111two's complement
64-bit1111111111111111111111111111111111111111111111001011110010110111two's complement
One's complement00000000000000110100001101001000at 32 bits, every bit flipped
Bits reversed11101101001111010011111111111111at 32 bits
Rotated left by 111111111111110010111100101101111at 32 bits, wrapping
Shifted left by 1-1101000011010010010= -427,666, no wrap
Shifted right by 1-11010000110100101= -106,916, discarding the low bit
These bits as a double1.05647539 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-213,833 to the power 245,724,551,889
-213,833 to the power 3-9,777,418,104,080,537
-213,833 to the power 42,090,734,645,449,853,468,321
-213,833 to the power 5-447,068,061,440,478,516,691,484,393
First ten multiples-213,833, -427,666, -641,499, -855,332, -1,069,165, -1,282,998, -1,496,831, -1,710,664, -1,924,497, -2,138,330
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
As a percentage & fraction
As a percentage-21,383,300%
-213,833% as a decimal-2,138.33
-213,833% of 100-213,833
-213,833% of 1,000-2,138,330
As a fraction of 100-213,833/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -213,833
Nerdulate something else
Nothing in mind? Surprise me · today’s page