Recognised as Number
-131,639
- Negative
- Odd
- 6 digits
-131,639 is an odd 6-digit integer and the negative of 131,639. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value131,639
Digit count6
Digit sum23
Digit product486
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 131,639
Distinct prime factors1131,639
Number of divisors2
Sum of divisors σ(n)131,640
SquarefreeYesno repeated prime factor
All divisors1, 131,6392 in total
Arithmetic
Representations
Decimal-131,639
Binary10000000100011011118 bits
Octal401067
Hexadecimal20237
Base 362TKN
In wordsminus one hundred and thirty-one thousand, six hundred and thirty-nine
Ordinalminus one hundred and thirty-one thousand, six hundred and thirty-ninth
Scientific notation-1.31639 × 10^5
Engineering notation-131.639 × 10^3
In other bases
Ternary20200120112base 3; the most digit-efficient integer base after e: 11 digits
Quinary13203024base 5; one hand: 8 digits
Septenary1055534base 7: 7 digits
Nonary220515base 9; each digit is two ternary digits: 6 digits
Duodecimal6421bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg91jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:33:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T10T11T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001011011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111110111001001
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 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 02 37
Gray code110000001100101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111110111001001two's complement
64-bit1111111111111111111111111111111111111111111111011111110111001001two's complement
One's complement00000000000000100000001000110110at 32 bits, every bit flipped
Bits reversed10010011101111111011111111111111at 32 bits
Rotated left by 111111111111110111111101110010011at 32 bits, wrapping
Shifted left by 1-1000000010001101110= -263,278, no wrap
Shifted right by 1-10000000100011100= -65,819, discarding the low bit
These bits as a double6.50383076 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-131,639 to the power 217,328,826,321
-131,639 to the power 3-2,281,149,368,070,119
-131,639 to the power 4300,288,221,663,382,395,041
-131,639 to the power 5-39,529,641,211,545,995,100,802,199
First ten multiples-131,639, -263,278, -394,917, -526,556, -658,195, -789,834, -921,473, -1,053,112, -1,184,751, -1,316,390
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
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 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 39
As a percentage & fraction
As a percentage-13,163,900%
-131,639% as a decimal-1,316.39
-131,639% of 100-131,639
-131,639% of 1,000-1,316,390
As a fraction of 100-131,639/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -131,639
Nerdulate something else
Nothing in mind? Surprise me · today’s page