Recognised as Number
-10,987
- Negative
- Odd
- 5 digits
-10,987 is an odd 5-digit integer and the negative of 10,987. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,987
Digit count5
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 10,987
Distinct prime factors110,987
Number of divisors2
Sum of divisors σ(n)10,988
SquarefreeYesno repeated prime factor
All divisors1, 10,9872 in total
Arithmetic
Representations
Decimal-10,987
Binary1010101110101114 bits
Octal25353
Hexadecimal2AEB
Base 368H7
In wordsminus ten thousand, nine hundred and eighty-seven
Ordinalminus ten thousand, nine hundred and eighty-seventh
Scientific notation-1.0987 × 10^4
Engineering notation-10.987 × 10^3
In other bases
Ternary120001221base 3; the most digit-efficient integer base after e: 9 digits
Quinary322422base 5; one hand: 6 digits
Septenary44014base 7: 5 digits
Nonary16057base 9; each digit is two ternary digits: 5 digits
Duodecimal6437base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1797base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:3:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1100T101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010100010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101010100010101
Bit length14 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits5within that length
Bit parityodd9 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
Bytes22a eb
Gray code11111110011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101010100010101two's complement
32-bit11111111111111111101010100010101two's complement
64-bit1111111111111111111111111111111111111111111111111101010100010101two's complement
One's complement0010101011101010at 16 bits, every bit flipped
Bits reversed1010100010101011at 16 bits
Rotated left by 11010101000101011at 16 bits, wrapping
Shifted left by 1-101010111010110= -21,974, no wrap
Shifted right by 1-1010101110110= -5,493, discarding the low bit
These bits as a double5.42829925 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-10,987 to the power 2120,714,169
-10,987 to the power 3-1,326,286,574,803
-10,987 to the power 414,571,910,597,360,561
-10,987 to the power 5-160,101,581,733,200,483,707
First ten multiples-10,987, -21,974, -32,961, -43,948, -54,935, -65,922, -76,909, -87,896, -98,883, -109,870
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
As a percentage & fraction
As a percentage-1,098,700%
-10,987% as a decimal-109.87
-10,987% of 100-10,987
-10,987% of 1,000-109,870
As a fraction of 100-10,987/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -10,987
Nerdulate something else
Nothing in mind? Surprise me · today’s page