Recognised as Number
-198,221
- Negative
- Odd
- 6 digits
-198,221 is an odd 6-digit integer and the negative of 198,221. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value198,221
Digit count6
Digit sum23
Digit product288
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 198,221
Distinct prime factors1198,221
Number of divisors2
Sum of divisors σ(n)198,222
SquarefreeYesno repeated prime factor
All divisors1, 198,2212 in total
Arithmetic
Representations
Decimal-198,221
Binary11000001100100110118 bits
Octal603115
Hexadecimal3064D
Base 3648Y5
In wordsminus one hundred and ninety-eight thousand, two hundred and twenty-one
Ordinalminus one hundred and ninety-eight thousand, two hundred and twenty-first
Scientific notation-1.98221 × 10^5
Engineering notation-198.221 × 10^3
In other bases
Ternary101001220112base 3; the most digit-efficient integer base after e: 12 digits
Quinary22320341base 5; one hand: 8 digits
Septenary1453622base 7: 7 digits
Nonary331815base 9; each digit is two ternary digits: 6 digits
Duodecimal96865base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal14fb1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal55:3:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0T101T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000111011110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001111100110110011
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 06 4d
Gray code101000010101101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001111100110110011two's complement
64-bit1111111111111111111111111111111111111111111111001111100110110011two's complement
One's complement00000000000000110000011001001100at 32 bits, every bit flipped
Bits reversed11001101100111110011111111111111at 32 bits
Rotated left by 111111111111110011111001101100111at 32 bits, wrapping
Shifted left by 1-1100000110010011010= -396,442, no wrap
Shifted right by 1-11000001100100111= -99,110, discarding the low bit
These bits as a double9.79341864 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-198,221 to the power 239,291,564,841
-198,221 to the power 3-7,788,413,274,347,861
-198,221 to the power 41,543,827,067,654,507,355,281
-198,221 to the power 5-306,018,945,177,544,102,471,155,101
First ten multiples-198,221, -396,442, -594,663, -792,884, -991,105, -1,189,326, -1,387,547, -1,585,768, -1,783,989, -1,982,210
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-19,822,100%
-198,221% as a decimal-1,982.21
-198,221% of 100-198,221
-198,221% of 1,000-1,982,210
As a fraction of 100-198,221/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -198,221
Nerdulate something else
Nothing in mind? Surprise me · today’s page