Recognised as Number
-131,891
- Negative
- Odd
- 6 digits
-131,891 is an odd 6-digit integer and the negative of 131,891. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value131,891
Digit count6
Digit sum23
Digit product216
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 131,891
Distinct prime factors1131,891
Number of divisors2
Sum of divisors σ(n)131,892
SquarefreeYesno repeated prime factor
All divisors1, 131,8912 in total
Arithmetic
Representations
Decimal-131,891
Binary10000000110011001118 bits
Octal401463
Hexadecimal20333
Base 362TRN
In wordsminus one hundred and thirty-one thousand, eight hundred and ninety-one
Ordinalminus one hundred and thirty-one thousand, eight hundred and ninety-first
Scientific notation-1.31891 × 10^5
Engineering notation-131.891 × 10^3
In other bases
Ternary20200220212base 3; the most digit-efficient integer base after e: 11 digits
Quinary13210031base 5; one hand: 8 digits
Septenary1056344base 7: 7 digits
Nonary220825base 9; each digit is two ternary digits: 6 digits
Duodecimal643abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg9ebbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:38:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T10T01T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000110111011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111110011001101
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 03 33
Gray code110000001010101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111110011001101two's complement
64-bit1111111111111111111111111111111111111111111111011111110011001101two's complement
One's complement00000000000000100000001100110010at 32 bits, every bit flipped
Bits reversed10110011001111111011111111111111at 32 bits
Rotated left by 111111111111110111111100110011011at 32 bits, wrapping
Shifted left by 1-1000000011001100110= -263,782, no wrap
Shifted right by 1-10000000110011010= -65,945, discarding the low bit
These bits as a double6.51628121 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-131,891 to the power 217,395,235,881
-131,891 to the power 3-2,294,275,055,580,971
-131,891 to the power 4302,594,231,355,629,846,161
-131,891 to the power 5-39,909,455,767,725,376,040,020,451
First ten multiples-131,891, -263,782, -395,673, -527,564, -659,455, -791,346, -923,237, -1,055,128, -1,187,019, -1,318,910
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-13,189,100%
-131,891% as a decimal-1,318.91
-131,891% of 100-131,891
-131,891% of 1,000-1,318,910
As a fraction of 100-131,891/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -131,891
Nerdulate something else
Nothing in mind? Surprise me · today’s page