Recognised as Number
-199,809
- Negative
- Odd
- Perfect square
- 6 digits
-199,809 is an odd 6-digit integer and the negative of 199,809. It has 9 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value199,809
Digit count6
Digit sum36
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
Perfect squareYes, 447²
Factors & divisors
Prime factorisation−1 × 3^2 × 149^2
Distinct prime factors23, 149
Number of divisors9
Sum of divisors σ(n)290,563
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 149, 447, 1,341, 22,201, 66,603, 199,8099 in total
Arithmetic
Representations
Decimal-199,809
Binary11000011001000000118 bits
Octal606201
Hexadecimal30C81
Base 364A69
In wordsminus one hundred and ninety-nine thousand, eight hundred and nine
Ordinalminus one hundred and ninety-nine thousand, eight hundred and ninth
Scientific notation-1.99809 × 10^5
Engineering notation-199.809 × 10^3
In other bases
Ternary101011002100base 3; the most digit-efficient integer base after e: 12 digits
Quinary22343214base 5; one hand: 8 digits
Septenary1461351base 7: 7 digits
Nonary334070base 9; each digit is two ternary digits: 6 digits
Duodecimal97769base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal14ja9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal55:30:9base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0TT0T1T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011010010000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001111001101111111
Bit length18 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits12within that length
Bit parityeven6 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 81
Gray code101000101011000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001111001101111111two's complement
64-bit1111111111111111111111111111111111111111111111001111001101111111two's complement
One's complement00000000000000110000110010000000at 32 bits, every bit flipped
Bits reversed11111110110011110011111111111111at 32 bits
Rotated left by 111111111111110011110011011111111at 32 bits, wrapping
Shifted left by 1-1100001100100000010= -399,618, no wrap
Shifted right by 1-11000011001000001= -99,904, discarding the low bit
These bits as a double9.87187626 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-199,809 to the power 239,923,636,481
-199,809 to the power 3-7,977,101,881,632,129
-199,809 to the power 41,593,896,749,867,034,063,361
-199,809 to the power 5-318,474,915,694,182,209,166,098,049
First ten multiples-199,809, -399,618, -599,427, -799,236, -999,045, -1,198,854, -1,398,663, -1,598,472, -1,798,281, -1,998,090
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-19,980,900%
-199,809% as a decimal-1,998.09
-199,809% of 100-199,809
-199,809% of 1,000-1,998,090
As a fraction of 100-199,809/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -199,809
Nerdulate something else
Nothing in mind? Surprise me · today’s page