Recognised as Number
-100,110
- Negative
- Even
- 6 digits
-100,110 is an even 6-digit integer and the negative of 100,110. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value100,110
Digit count6
Digit sum3
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3 × 5 × 47 × 71
Distinct prime factors52, 3, 5, 47, 71
Number of divisors32
Sum of divisors σ(n)248,832
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 5, 6, 10, 15, 30, 47, 71, 94, 141, 142, 213, 235, 282, 355, 426, 470, 705, 710, 1,065, 1,410, 2,130, 3,337, 6,674, 10,011, 16,685, 20,022, 33,370, 50,055, 100,11032 in total
Arithmetic
Representations
Decimal-100,110
Binary1100001110000111017 bits
Octal303416
Hexadecimal1870E
Base 36258U
In wordsminus one hundred thousand, one hundred and ten
Ordinalminus one hundred thousand, one hundred and tenth
Scientific notation-1.0011 × 10^5
Engineering notation-100.11 × 10^3
In other bases
Ternary12002022210base 3; the most digit-efficient integer base after e: 11 digits
Quinary11200420base 5; one hand: 8 digits
Septenary564603base 7: 6 digits
Nonary162283base 9; each digit is two ternary digits: 6 digits
Duodecimal49b26base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalca5abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:48:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110T1T001T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000100100110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111100011110010
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 87 0e
Gray code10100010010001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111100011110010two's complement
64-bit1111111111111111111111111111111111111111111111100111100011110010two's complement
One's complement00000000000000011000011100001101at 32 bits, every bit flipped
Bits reversed01001111000111100111111111111111at 32 bits
Rotated left by 111111111111111001111000111100101at 32 bits, wrapping
Shifted left by 1-110000111000011100= -200,220, no wrap
Shifted right by 1-1100001110000111= -50,055, discarding the low bit
These bits as a double4.94609118 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-100,110 to the power 210,022,012,100
-100,110 to the power 3-1,003,303,631,331,000
-100,110 to the power 4100,440,726,532,546,410,000
-100,110 to the power 5-10,055,121,133,173,221,105,100,000
First ten multiples-100,110, -200,220, -300,330, -400,440, -500,550, -600,660, -700,770, -800,880, -900,990, -1,001,100
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 10
As a percentage & fraction
As a percentage-10,011,000%
-100,110% as a decimal-1,001.1
-100,110% of 100-100,110
-100,110% of 1,000-1,001,100
As a fraction of 100-100,110/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -100,110
Nerdulate something else
Nothing in mind? Surprise me · today’s page