Recognised as Number
-3,981
- Negative
- Odd
- 4 digits
-3,981 is an odd 4-digit integer and the negative of 3,981. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,981
Digit count4
Digit sum21
Digit product216
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 1,327
Distinct prime factors23, 1,327
Number of divisors4
Sum of divisors σ(n)5,312
SquarefreeYesno repeated prime factor
All divisors1, 3, 1,327, 3,9814 in total
Arithmetic
Previous number-3,982
Next number-3,980
Double-7,962
Half-1,990.5
Square15,848,361
Cube-63,092,325,141
Cube root-15.848836769≈
Negation3,981
Reciprocal-0.0002511932≈
Representations
Decimal-3,981
Binary11111000110112 bits
Octal7615
HexadecimalF8D
Base 3632L
In wordsminus three thousand, nine hundred and eighty-one
Ordinalminus three thousand, nine hundred and eighty-first
Scientific notation-3.981 × 10^3
Engineering notation-3.981 × 10^3
In other bases
Ternary12110110base 3; the most digit-efficient integer base after e — 8 digits
Quinary111411base 5; one hand — 6 digits
Septenary14415base 7 — 5 digits
Nonary5413base 9; each digit is two ternary digits — 4 digits
Duodecimal2379base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 4 digits
Vigesimal9j1base 20; hands and feet, and the Mayan and Yoruba systems — 3 digits
Sexagesimal1:6:21base 60; Babylonian, and still how an hour and a circle are divided — 3 digits
Balanced ternaryT11TT0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000110110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111000001110011
Bit length12 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits4within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes20f 8d
Gray code100001001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111000001110011two's complement
32-bit11111111111111111111000001110011two's complement
64-bit1111111111111111111111111111111111111111111111111111000001110011two's complement
One's complement0000111110001100at 16 bits, every bit flipped
Bits reversed1100111000001111at 16 bits
Rotated left by 11110000011100111at 16 bits, wrapping
Shifted left by 1-1111100011010= -7,962, no wrap
Shifted right by 1-11111000111= -1,990, discarding the low bit
These bits as a double1.96687534 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,981 to the power 215,848,361
-3,981 to the power 3-63,092,325,141
-3,981 to the power 4251,170,546,386,321
-3,981 to the power 5-999,909,945,163,943,901
First ten multiples-3,981, -7,962, -11,943, -15,924, -19,905, -23,886, -27,867, -31,848, -35,829, -39,810
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 81
As a percentage & fraction
As a percentage-398,100%
-3,981% as a decimal-39.81
-3,981% of 100-3,981
-3,981% of 1,000-39,810
As a fraction of 100-3,981/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,981
Nerdulate something else
Nothing in mind? Surprise me · today’s page