Recognised as Number
-100,113
- Negative
- Odd
- 6 digits
-100,113 is an odd 6-digit integer and the negative of 100,113. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value100,113
Digit count6
Digit sum6
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 13 × 17 × 151
Distinct prime factors43, 13, 17, 151
Number of divisors16
Sum of divisors σ(n)153,216
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 17, 39, 51, 151, 221, 453, 663, 1,963, 2,567, 5,889, 7,701, 33,371, 100,11316 in total
Arithmetic
Representations
Decimal-100,113
Binary1100001110001000117 bits
Octal303421
Hexadecimal18711
Base 36258X
In wordsminus one hundred thousand, one hundred and thirteen
Ordinalminus one hundred thousand, one hundred and thirteenth
Scientific notation-1.00113 × 10^5
Engineering notation-100.113 × 10^3
In other bases
Ternary12002022220base 3; the most digit-efficient integer base after e: 11 digits
Quinary11200423base 5; one hand: 8 digits
Septenary564606base 7: 6 digits
Nonary162286base 9; each digit is two ternary digits: 6 digits
Duodecimal49b29base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalca5dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:48:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110T1T00010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111000100100110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111100011101111
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 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 11
Gray code10100010010011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111100011101111two's complement
64-bit1111111111111111111111111111111111111111111111100111100011101111two's complement
One's complement00000000000000011000011100010000at 32 bits, every bit flipped
Bits reversed11110111000111100111111111111111at 32 bits
Rotated left by 111111111111111001111000111011111at 32 bits, wrapping
Shifted left by 1-110000111000100010= -200,226, no wrap
Shifted right by 1-1100001110001001= -50,056, discarding the low bit
These bits as a double4.9462394 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-100,113 to the power 210,022,612,769
-100,113 to the power 3-1,003,393,832,142,897
-100,113 to the power 4100,452,766,717,321,847,361
-100,113 to the power 5-10,056,627,834,371,242,104,851,793
First ten multiples-100,113, -200,226, -300,339, -400,452, -500,565, -600,678, -700,791, -800,904, -901,017, -1,001,130
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-10,011,300%
-100,113% as a decimal-1,001.13
-100,113% of 100-100,113
-100,113% of 1,000-1,001,130
As a fraction of 100-100,113/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -100,113
Nerdulate something else
Nothing in mind? Surprise me · today’s page