Recognised as Number
-198,413
- Negative
- Odd
- 6 digits
-198,413 is an odd 6-digit integer and the negative of 198,413. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value198,413
Digit count6
Digit sum26
Digit product864
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 198,413
Distinct prime factors1198,413
Number of divisors2
Sum of divisors σ(n)198,414
SquarefreeYesno repeated prime factor
All divisors1, 198,4132 in total
Arithmetic
Representations
Decimal-198,413
Binary11000001110000110118 bits
Octal603415
Hexadecimal3070D
Base 36493H
In wordsminus one hundred and ninety-eight thousand, four hundred and thirteen
Ordinalminus one hundred and ninety-eight thousand, four hundred and thirteenth
Scientific notation-1.98413 × 10^5
Engineering notation-198.413 × 10^3
In other bases
Ternary101002011122base 3; the most digit-efficient integer base after e: 12 digits
Quinary22322123base 5; one hand: 8 digits
Septenary1454315base 7: 7 digits
Nonary332148base 9; each digit is two ternary digits: 6 digits
Duodecimal969a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal14g0dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal55:6:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0T1T11101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010000100100110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111001111100011110011
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 07 0d
Gray code101000010010001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111001111100011110011two's complement
64-bit1111111111111111111111111111111111111111111111001111100011110011two's complement
One's complement00000000000000110000011100001100at 32 bits, every bit flipped
Bits reversed11001111000111110011111111111111at 32 bits
Rotated left by 111111111111110011111000111100111at 32 bits, wrapping
Shifted left by 1-1100000111000011010= -396,826, no wrap
Shifted right by 1-11000001110000111= -99,206, discarding the low bit
These bits as a double9.8029047 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-198,413 to the power 239,367,718,569
-198,413 to the power 3-7,811,067,144,430,997
-198,413 to the power 41,549,817,265,327,987,407,761
-198,413 to the power 5-307,503,893,065,521,965,536,083,293
First ten multiples-198,413, -396,826, -595,239, -793,652, -992,065, -1,190,478, -1,388,891, -1,587,304, -1,785,717, -1,984,130
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-19,841,300%
-198,413% as a decimal-1,984.13
-198,413% of 100-198,413
-198,413% of 1,000-1,984,130
As a fraction of 100-198,413/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -198,413
Nerdulate something else
Nothing in mind? Surprise me · today’s page