Recognised as Number
-16,381
- Negative
- Odd
- 5 digits
-16,381 is an odd 5-digit integer and the negative of 16,381. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,381
Digit count5
Digit sum19
Digit product144
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 16,381
Distinct prime factors116,381
Number of divisors2
Sum of divisors σ(n)16,382
SquarefreeYesno repeated prime factor
All divisors1, 16,3812 in total
Arithmetic
Representations
Decimal-16,381
Binary1111111111110114 bits
Octal37775
Hexadecimal3FFD
Base 36CN1
In wordsminus sixteen thousand, three hundred and eighty-one
Ordinalminus sixteen thousand, three hundred and eighty-first
Scientific notation-1.6381 × 10^4
Engineering notation-16.381 × 10^3
In other bases
Ternary211110201base 3; the most digit-efficient integer base after e: 9 digits
Quinary1011011base 5; one hand: 7 digits
Septenary65521base 7: 5 digits
Nonary24421base 9; each digit is two ternary digits: 5 digits
Duodecimal9591base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal20j1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:33:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTTTT10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000000000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100000000000011
Bit length14 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits1within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes23f fd
Gray code10000000000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100000000000011two's complement
32-bit11111111111111111100000000000011two's complement
64-bit1111111111111111111111111111111111111111111111111100000000000011two's complement
One's complement0011111111111100at 16 bits, every bit flipped
Bits reversed1100000000000011at 16 bits
Rotated left by 11000000000000111at 16 bits, wrapping
Shifted left by 1-111111111111010= -32,762, no wrap
Shifted right by 1-1111111111111= -8,190, discarding the low bit
These bits as a double8.09328934 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-16,381 to the power 2268,337,161
-16,381 to the power 3-4,395,631,034,341
-16,381 to the power 472,004,831,973,539,921
-16,381 to the power 5-1,179,511,152,558,557,445,901
First ten multiples-16,381, -32,762, -49,143, -65,524, -81,905, -98,286, -114,667, -131,048, -147,429, -163,810
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
As a percentage & fraction
As a percentage-1,638,100%
-16,381% as a decimal-163.81
-16,381% of 100-16,381
-16,381% of 1,000-163,810
As a fraction of 100-16,381/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -16,381
Nerdulate something else
Nothing in mind? Surprise me · today’s page