Recognised as Number
-111,013
- Negative
- Odd
- 6 digits
-111,013 is an odd 6-digit integer and the negative of 111,013. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value111,013
Digit count6
Digit sum7
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 15,859
Distinct prime factors27, 15,859
Number of divisors4
Sum of divisors σ(n)126,880
SquarefreeYesno repeated prime factor
All divisors1, 7, 15,859, 111,0134 in total
Arithmetic
Representations
Decimal-111,013
Binary1101100011010010117 bits
Octal330645
Hexadecimal1B1A5
Base 362DNP
In wordsminus one hundred and eleven thousand and thirteen
Ordinalminus one hundred and eleven thousand and thirteenth
Scientific notation-1.11013 × 10^5
Engineering notation-111.013 × 10^3
In other bases
Ternary12122021121base 3; the most digit-efficient integer base after e: 11 digits
Quinary12023023base 5; one hand: 8 digits
Septenary641440base 7: 6 digits
Nonary178247base 9; each digit is two ternary digits: 6 digits
Duodecimal542b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldhadbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:50:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10101T0111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101001110101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100111001011011
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 b1 a5
Gray code10110100101110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100111001011011two's complement
64-bit1111111111111111111111111111111111111111111111100100111001011011two's complement
One's complement00000000000000011011000110100100at 32 bits, every bit flipped
Bits reversed11011010011100100111111111111111at 32 bits
Rotated left by 111111111111111001001110010110111at 32 bits, wrapping
Shifted left by 1-110110001101001010= -222,026, no wrap
Shifted right by 1-1101100011010011= -55,506, discarding the low bit
These bits as a double5.48477095 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-111,013 to the power 212,323,886,169
-111,013 to the power 3-1,368,111,575,279,197
-111,013 to the power 4151,878,170,306,469,496,561
-111,013 to the power 5-16,860,451,320,232,098,221,726,293
First ten multiples-111,013, -222,026, -333,039, -444,052, -555,065, -666,078, -777,091, -888,104, -999,117, -1,110,130
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-11,101,300%
-111,013% as a decimal-1,110.13
-111,013% of 100-111,013
-111,013% of 1,000-1,110,130
As a fraction of 100-111,013/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -111,013
Nerdulate something else
Nothing in mind? Surprise me · today’s page