Recognised as Number
-199,833
- Negative
- Odd
- 6 digits
-199,833 is an odd 6-digit integer and the negative of 199,833. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value199,833
Digit count6
Digit sum33
Digit product5,832
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 59 × 1,129
Distinct prime factors33, 59, 1,129
Number of divisors8
Sum of divisors σ(n)271,200
SquarefreeYesno repeated prime factor
All divisors1, 3, 59, 177, 1,129, 3,387, 66,611, 199,8338 in total
Arithmetic
Representations
Decimal-199,833
Binary11000011001001100118 bits
Octal606231
Hexadecimal30C99
Base 364A6X
In wordsminus one hundred and ninety-nine thousand, eight hundred and thirty-three
Ordinalminus one hundred and ninety-nine thousand, eight hundred and thirty-third
Scientific notation-1.99833 × 10^5
Engineering notation-199.833 × 10^3
In other bases
Ternary101011010020base 3; the most digit-efficient integer base after e: 12 digits
Quinary22343313base 5; one hand: 8 digits
Septenary1461414base 7: 7 digits
Nonary334106base 9; each digit is two ternary digits: 6 digits
Duodecimal97789base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal14jbdbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal55:30:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0TT0T0T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011010010111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001111001101100111
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 0c 99
Gray code101000101011010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001111001101100111two's complement
64-bit1111111111111111111111111111111111111111111111001111001101100111two's complement
One's complement00000000000000110000110010011000at 32 bits, every bit flipped
Bits reversed11100110110011110011111111111111at 32 bits
Rotated left by 111111111111110011110011011001111at 32 bits, wrapping
Shifted left by 1-1100001100100110010= -399,666, no wrap
Shifted right by 1-11000011001001101= -99,916, discarding the low bit
These bits as a double9.87306202 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-199,833 to the power 239,933,227,889
-199,833 to the power 3-7,979,976,728,742,537
-199,833 to the power 41,594,662,689,634,807,396,321
-199,833 to the power 5-318,666,229,257,792,466,429,014,393
First ten multiples-199,833, -399,666, -599,499, -799,332, -999,165, -1,198,998, -1,398,831, -1,598,664, -1,798,497, -1,998,330
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 33
As a percentage & fraction
As a percentage-19,983,300%
-199,833% as a decimal-1,998.33
-199,833% of 100-199,833
-199,833% of 1,000-1,998,330
As a fraction of 100-199,833/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -199,833
Nerdulate something else
Nothing in mind? Surprise me · today’s page