Recognised as Number
-136,987
- Negative
- Odd
- 6 digits
-136,987 is an odd 6-digit integer and the negative of 136,987. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value136,987
Digit count6
Digit sum34
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 136,987
Distinct prime factors1136,987
Number of divisors2
Sum of divisors σ(n)136,988
SquarefreeYesno repeated prime factor
All divisors1, 136,9872 in total
Arithmetic
Representations
Decimal-136,987
Binary10000101110001101118 bits
Octal413433
Hexadecimal2171B
Base 362XP7
In wordsminus one hundred and thirty-six thousand, nine hundred and eighty-seven
Ordinalminus one hundred and thirty-six thousand, nine hundred and eighty-seventh
Scientific notation-1.36987 × 10^5
Engineering notation-136.987 × 10^3
In other bases
Ternary20221220121base 3; the most digit-efficient integer base after e: 11 digits
Quinary13340422base 5; one hand: 8 digits
Septenary1110244base 7: 7 digits
Nonary227817base 9; each digit is two ternary digits: 6 digits
Duodecimal67337base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh297base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:3:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T00101T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011100100100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110100011100101
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 17 1b
Gray code110001110010010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110100011100101two's complement
64-bit1111111111111111111111111111111111111111111111011110100011100101two's complement
One's complement00000000000000100001011100011010at 32 bits, every bit flipped
Bits reversed10100111000101111011111111111111at 32 bits
Rotated left by 111111111111110111101000111001011at 32 bits, wrapping
Shifted left by 1-1000010111000110110= -273,974, no wrap
Shifted right by 1-10000101110001110= -68,493, discarding the low bit
These bits as a double6.76805706 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-136,987 to the power 218,765,438,169
-136,987 to the power 3-2,570,621,078,456,803
-136,987 to the power 4352,141,669,674,562,072,561
-136,987 to the power 5-48,238,830,903,709,234,633,913,707
First ten multiples-136,987, -273,974, -410,961, -547,948, -684,935, -821,922, -958,909, -1,095,896, -1,232,883, -1,369,870
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
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 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
As a percentage & fraction
As a percentage-13,698,700%
-136,987% as a decimal-1,369.87
-136,987% of 100-136,987
-136,987% of 1,000-1,369,870
As a fraction of 100-136,987/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -136,987
Nerdulate something else
Nothing in mind? Surprise me · today’s page