Recognised as Number
-16,379
- Negative
- Odd
- 5 digits
-16,379 is an odd 5-digit integer and the negative of 16,379. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,379
Digit count5
Digit sum26
Digit product1,134
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 11 × 1,489
Distinct prime factors211, 1,489
Number of divisors4
Sum of divisors σ(n)17,880
SquarefreeYesno repeated prime factor
All divisors1, 11, 1,489, 16,3794 in total
Arithmetic
Representations
Decimal-16,379
Binary1111111111101114 bits
Octal37773
Hexadecimal3FFB
Base 36CMZ
In wordsminus sixteen thousand, three hundred and seventy-nine
Ordinalminus sixteen thousand, three hundred and seventy-ninth
Scientific notation-1.6379 × 10^4
Engineering notation-16.379 × 10^3
In other bases
Ternary211110122base 3; the most digit-efficient integer base after e: 9 digits
Quinary1011004base 5; one hand: 7 digits
Septenary65516base 7: 5 digits
Nonary24418base 9; each digit is two ternary digits: 5 digits
Duodecimal958bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal20ijbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal4:32:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTTTT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000000000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1100000000000101
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 fb
Gray code10000000000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1100000000000101two's complement
32-bit11111111111111111100000000000101two's complement
64-bit1111111111111111111111111111111111111111111111111100000000000101two's complement
One's complement0011111111111010at 16 bits, every bit flipped
Bits reversed1010000000000011at 16 bits
Rotated left by 11000000000001011at 16 bits, wrapping
Shifted left by 1-111111111110110= -32,758, no wrap
Shifted right by 1-1111111111110= -8,189, discarding the low bit
These bits as a double8.09230121 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-16,379 to the power 2268,271,641
-16,379 to the power 3-4,394,021,207,939
-16,379 to the power 471,969,673,364,832,881
-16,379 to the power 5-1,178,791,280,042,597,757,899
First ten multiples-16,379, -32,758, -49,137, -65,516, -81,895, -98,274, -114,653, -131,032, -147,411, -163,790
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 79
As a percentage & fraction
As a percentage-1,637,900%
-16,379% as a decimal-163.79
-16,379% of 100-16,379
-16,379% of 1,000-163,790
As a fraction of 100-16,379/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -16,379
Nerdulate something else
Nothing in mind? Surprise me · today’s page