Recognised as Number
-100,111
- Negative
- Odd
- 6 digits
-100,111 is an odd 6-digit integer and the negative of 100,111. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value100,111
Digit count6
Digit sum4
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 11 × 19 × 479
Distinct prime factors311, 19, 479
Number of divisors8
Sum of divisors σ(n)115,200
SquarefreeYesno repeated prime factor
All divisors1, 11, 19, 209, 479, 5,269, 9,101, 100,1118 in total
Arithmetic
Representations
Decimal-100,111
Binary1100001110000111117 bits
Octal303417
Hexadecimal1870F
Base 36258V
In wordsminus one hundred thousand, one hundred and eleven
Ordinalminus one hundred thousand, one hundred and eleventh
Scientific notation-1.00111 × 10^5
Engineering notation-100.111 × 10^3
In other bases
Ternary12002022211base 3; the most digit-efficient integer base after e: 11 digits
Quinary11200421base 5; one hand: 8 digits
Septenary564604base 7: 6 digits
Nonary162284base 9; each digit is two ternary digits: 6 digits
Duodecimal49b27base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalca5bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:48:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110T1T001TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000100100110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111100011110001
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 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 0f
Gray code10100010010001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111100011110001two's complement
64-bit1111111111111111111111111111111111111111111111100111100011110001two's complement
One's complement00000000000000011000011100001110at 32 bits, every bit flipped
Bits reversed10001111000111100111111111111111at 32 bits
Rotated left by 111111111111111001111000111100011at 32 bits, wrapping
Shifted left by 1-110000111000011110= -200,222, no wrap
Shifted right by 1-1100001110001000= -50,055, discarding the low bit
These bits as a double4.94614059 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-100,111 to the power 210,022,212,321
-100,111 to the power 3-1,003,333,697,667,631
-100,111 to the power 4100,444,739,807,204,207,041
-100,111 to the power 5-10,055,623,346,839,020,371,081,551
First ten multiples-100,111, -200,222, -300,333, -400,444, -500,555, -600,666, -700,777, -800,888, -900,999, -1,001,110
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
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 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-10,011,100%
-100,111% as a decimal-1,001.11
-100,111% of 100-100,111
-100,111% of 1,000-1,001,110
As a fraction of 100-100,111/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -100,111
Nerdulate something else
Nothing in mind? Surprise me · today’s page