Recognised as Number
-16,190
- Negative
- Even
- 5 digits
-16,190 is an even 5-digit integer and the negative of 16,190. It has 8 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value16,190
Digit count5
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 1,619
Distinct prime factors32, 5, 1,619
Number of divisors8
Sum of divisors σ(n)29,160
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 1,619, 3,238, 8,095, 16,1908 in total
Arithmetic
Representations
Decimal-16,190
Binary1111110011111014 bits
Octal37476
Hexadecimal3F3E
Base 36CHQ
In wordsminus sixteen thousand, one hundred and ninety
Ordinalminus sixteen thousand, one hundred and ninetieth
Scientific notation-1.619 × 10^4
Engineering notation-16.19 × 10^3
In other bases
Ternary211012122base 3; the most digit-efficient integer base after e: 9 digits
Quinary1004230base 5; one hand: 7 digits
Septenary65126base 7: 5 digits
Nonary24178base 9; each digit is two ternary digits: 5 digits
Duodecimal9452base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal209abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:29:50base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTT10101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000111000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100000011000010
Bit length14 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits3within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 13worth 8,192
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes23f 3e
Gray code10000010100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100000011000010two's complement
32-bit11111111111111111100000011000010two's complement
64-bit1111111111111111111111111111111111111111111111111100000011000010two's complement
One's complement0011111100111101at 16 bits, every bit flipped
Bits reversed0100001100000011at 16 bits
Rotated left by 11000000110000101at 16 bits, wrapping
Shifted left by 1-111111001111100= -32,380, no wrap
Shifted right by 1-1111110011111= -8,095, discarding the low bit
These bits as a double7.99892281 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-16,190 to the power 2262,116,100
-16,190 to the power 3-4,243,659,659,000
-16,190 to the power 468,704,849,879,210,000
-16,190 to the power 5-1,112,331,519,544,409,900,000
First ten multiples-16,190, -32,380, -48,570, -64,760, -80,950, -97,140, -113,330, -129,520, -145,710, -161,900
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 9
Divisible by 12No, remainder 2
Divisible by 100No, remainder 90
As a percentage & fraction
As a percentage-1,619,000%
-16,190% as a decimal-161.9
-16,190% of 100-16,190
-16,190% of 1,000-161,900
As a fraction of 100-16,190/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -16,190
Nerdulate something else
Nothing in mind? Surprise me · today’s page