Recognised as Number
-100,331
- Negative
- Odd
- 6 digits
-100,331 is an odd 6-digit integer and the negative of 100,331. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value100,331
Digit count6
Digit sum8
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 11 × 1,303
Distinct prime factors37, 11, 1,303
Number of divisors8
Sum of divisors σ(n)125,184
SquarefreeYesno repeated prime factor
All divisors1, 7, 11, 77, 1,303, 9,121, 14,333, 100,3318 in total
Arithmetic
Representations
Decimal-100,331
Binary1100001111110101117 bits
Octal303753
Hexadecimal187EB
Base 3625EZ
In wordsminus one hundred thousand, three hundred and thirty-one
Ordinalminus one hundred thousand, three hundred and thirty-first
Scientific notation-1.00331 × 10^5
Engineering notation-100.331 × 10^3
In other bases
Ternary12002121222base 3; the most digit-efficient integer base after e: 11 digits
Quinary11202311base 5; one hand: 8 digits
Septenary565340base 7: 6 digits
Nonary162558base 9; each digit is two ternary digits: 6 digits
Duodecimal4a08bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalcagbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:52:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110T0101001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000100000010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111100000010101
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 87 eb
Gray code10100010000011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111100000010101two's complement
64-bit1111111111111111111111111111111111111111111111100111100000010101two's complement
One's complement00000000000000011000011111101010at 32 bits, every bit flipped
Bits reversed10101000000111100111111111111111at 32 bits
Rotated left by 111111111111111001111000000101011at 32 bits, wrapping
Shifted left by 1-110000111111010110= -200,662, no wrap
Shifted right by 1-1100001111110110= -50,165, discarding the low bit
These bits as a double4.95701003 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-100,331 to the power 210,066,309,561
-100,331 to the power 3-1,009,962,904,564,691
-100,331 to the power 4101,330,588,177,880,012,721
-100,331 to the power 5-10,166,599,242,474,879,556,310,651
First ten multiples-100,331, -200,662, -300,993, -401,324, -501,655, -601,986, -702,317, -802,648, -902,979, -1,003,310
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
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 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 31
As a percentage & fraction
As a percentage-10,033,100%
-100,331% as a decimal-1,003.31
-100,331% of 100-100,331
-100,331% of 1,000-1,003,310
As a fraction of 100-100,331/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -100,331
Nerdulate something else
Nothing in mind? Surprise me · today’s page