Recognised as Number
-198,420
- Negative
- Even
- 6 digits
-198,420 is an even 6-digit integer and the negative of 198,420. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value198,420
Digit count6
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 3 × 5 × 3,307
Distinct prime factors42, 3, 5, 3,307
Number of divisors24
Sum of divisors σ(n)555,744
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 3,307, 6,614, 9,921, 13,228, 16,535, 19,842, 33,070, 39,684, 49,605, 66,140, 99,210, 198,42024 in total
Arithmetic
Representations
Decimal-198,420
Binary11000001110001010018 bits
Octal603424
Hexadecimal30714
Base 36493O
In wordsminus one hundred and ninety-eight thousand, four hundred and twenty
Ordinalminus one hundred and ninety-eight thousand, four hundred and twentieth
Scientific notation-1.9842 × 10^5
Engineering notation-198.42 × 10^3
In other bases
Ternary101002011220base 3; the most digit-efficient integer base after e: 12 digits
Quinary22322140base 5; one hand: 8 digits
Septenary1454325base 7: 7 digits
Nonary332156base 9; each digit is two ternary digits: 6 digits
Duodecimal969b0base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal14g10base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal55:7:0base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0T1T11010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000100100111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001111100011101100
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 17worth 131,072
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes303 07 14
Gray code101000010010011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001111100011101100two's complement
64-bit1111111111111111111111111111111111111111111111001111100011101100two's complement
One's complement00000000000000110000011100010011at 32 bits, every bit flipped
Bits reversed00110111000111110011111111111111at 32 bits
Rotated left by 111111111111110011111000111011001at 32 bits, wrapping
Shifted left by 1-1100000111000101000= -396,840, no wrap
Shifted right by 1-11000001110001010= -99,210, discarding the low bit
These bits as a double9.80325054 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-198,420 to the power 239,370,496,400
-198,420 to the power 3-7,811,893,895,688,000
-198,420 to the power 41,550,035,986,782,412,960,000
-198,420 to the power 5-307,558,140,497,366,379,523,200,000
First ten multiples-198,420, -396,840, -595,260, -793,680, -992,100, -1,190,520, -1,388,940, -1,587,360, -1,785,780, -1,984,200
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12Yes
Divisible by 100No, remainder 20
As a percentage & fraction
As a percentage-19,842,000%
-198,420% as a decimal-1,984.2
-198,420% of 100-198,420
-198,420% of 1,000-1,984,200
As a fraction of 100-198,420/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -198,420
Nerdulate something else
Nothing in mind? Surprise me · today’s page