Recognised as Number
-161,131
- Negative
- Odd
- 6 digits
-161,131 is an odd 6-digit integer and the negative of 161,131. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value161,131
Digit count6
Digit sum13
Digit product18
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 269 × 599
Distinct prime factors2269, 599
Number of divisors4
Sum of divisors σ(n)162,000
SquarefreeYesno repeated prime factor
All divisors1, 269, 599, 161,1314 in total
Arithmetic
Representations
Decimal-161,131
Binary10011101010110101118 bits
Octal472553
Hexadecimal2756B
Base 363GBV
In wordsminus one hundred and sixty-one thousand, one hundred and thirty-one
Ordinalminus one hundred and sixty-one thousand, one hundred and thirty-first
Scientific notation-1.61131 × 10^5
Engineering notation-161.131 × 10^3
In other bases
Ternary22012000211base 3; the most digit-efficient integer base after e: 11 digits
Quinary20124011base 5; one hand: 8 digits
Septenary1240525base 7: 7 digits
Nonary265024base 9; each digit is two ternary digits: 6 digits
Duodecimal792b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal102gbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal44:45:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01T1100T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001111110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011000101010010101
Bit length18 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits7within that length
Bit parityodd11 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 75 6b
Gray code110100111111011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011000101010010101two's complement
64-bit1111111111111111111111111111111111111111111111011000101010010101two's complement
One's complement00000000000000100111010101101010at 32 bits, every bit flipped
Bits reversed10101001010100011011111111111111at 32 bits
Rotated left by 111111111111110110001010100101011at 32 bits, wrapping
Shifted left by 1-1001110101011010110= -322,262, no wrap
Shifted right by 1-10011101010110110= -80,565, discarding the low bit
These bits as a double7.96092916 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-161,131 to the power 225,963,199,161
-161,131 to the power 3-4,183,476,244,011,091
-161,131 to the power 4674,087,710,673,751,103,921
-161,131 to the power 5-108,616,426,908,572,189,125,894,651
First ten multiples-161,131, -322,262, -483,393, -644,524, -805,655, -966,786, -1,127,917, -1,289,048, -1,450,179, -1,611,310
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
As a percentage & fraction
As a percentage-16,113,100%
-161,131% as a decimal-1,611.31
-161,131% of 100-161,131
-161,131% of 1,000-1,611,310
As a fraction of 100-161,131/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -161,131
Nerdulate something else
Nothing in mind? Surprise me · today’s page