Recognised as Number
-199,831
- Negative
- Odd
- 6 digits
-199,831 is an odd 6-digit integer and the negative of 199,831. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value199,831
Digit count6
Digit sum31
Digit product1,944
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 199,831
Distinct prime factors1199,831
Number of divisors2
Sum of divisors σ(n)199,832
SquarefreeYesno repeated prime factor
All divisors1, 199,8312 in total
Arithmetic
Representations
Decimal-199,831
Binary11000011001001011118 bits
Octal606227
Hexadecimal30C97
Base 364A6V
In wordsminus one hundred and ninety-nine thousand, eight hundred and thirty-one
Ordinalminus one hundred and ninety-nine thousand, eight hundred and thirty-first
Scientific notation-1.99831 × 10^5
Engineering notation-199.831 × 10^3
In other bases
Ternary101011010011base 3; the most digit-efficient integer base after e: 12 digits
Quinary22343311base 5; one hand: 8 digits
Septenary1461412base 7: 7 digits
Nonary334104base 9; each digit is two ternary digits: 6 digits
Duodecimal97787base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal14jbbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal55:30:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0TT0T00TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011010010111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001111001101101001
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 set bits, so odd; 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 97
Gray code101000101011011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001111001101101001two's complement
64-bit1111111111111111111111111111111111111111111111001111001101101001two's complement
One's complement00000000000000110000110010010110at 32 bits, every bit flipped
Bits reversed10010110110011110011111111111111at 32 bits
Rotated left by 111111111111110011110011011010011at 32 bits, wrapping
Shifted left by 1-1100001100100101110= -399,662, no wrap
Shifted right by 1-11000011001001100= -99,915, discarding the low bit
These bits as a double9.87296321 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-199,831 to the power 239,932,428,561
-199,831 to the power 3-7,979,737,131,773,191
-199,831 to the power 41,594,598,850,779,368,530,721
-199,831 to the power 5-318,650,282,950,091,992,862,508,151
First ten multiples-199,831, -399,662, -599,493, -799,324, -999,155, -1,198,986, -1,398,817, -1,598,648, -1,798,479, -1,998,310
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
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 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
As a percentage & fraction
As a percentage-19,983,100%
-199,831% as a decimal-1,998.31
-199,831% of 100-199,831
-199,831% of 1,000-1,998,310
As a fraction of 100-199,831/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -199,831
Nerdulate something else
Nothing in mind? Surprise me · today’s page