Recognised as Number
-111,133
- Negative
- Odd
- 6 digits
-111,133 is an odd 6-digit integer and the negative of 111,133. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value111,133
Digit count6
Digit sum10
Digit product9
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 11 × 10,103
Distinct prime factors211, 10,103
Number of divisors4
Sum of divisors σ(n)121,248
SquarefreeYesno repeated prime factor
All divisors1, 11, 10,103, 111,1334 in total
Arithmetic
Representations
Decimal-111,133
Binary1101100100001110117 bits
Octal331035
Hexadecimal1B21D
Base 362DR1
In wordsminus one hundred and eleven thousand, one hundred and thirty-three
Ordinalminus one hundred and eleven thousand, one hundred and thirty-third
Scientific notation-1.11133 × 10^5
Engineering notation-111.133 × 10^3
In other bases
Ternary12122110001base 3; the most digit-efficient integer base after e: 11 digits
Quinary12024013base 5; one hand: 8 digits
Septenary642001base 7: 6 digits
Nonary178401base 9; each digit is two ternary digits: 6 digits
Duodecimal54391base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldhgdbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:52:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10101TT000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101001000100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100110111100011
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 b2 1d
Gray code10110101100010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100110111100011two's complement
64-bit1111111111111111111111111111111111111111111111100100110111100011two's complement
One's complement00000000000000011011001000011100at 32 bits, every bit flipped
Bits reversed11000111101100100111111111111111at 32 bits
Rotated left by 111111111111111001001101111000111at 32 bits, wrapping
Shifted left by 1-110110010000111010= -222,266, no wrap
Shifted right by 1-1101100100001111= -55,566, discarding the low bit
These bits as a double5.49069974 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-111,133 to the power 212,350,543,689
-111,133 to the power 3-1,372,552,971,789,637
-111,133 to the power 4152,535,929,413,897,728,721
-111,133 to the power 5-16,951,775,443,554,696,285,950,893
First ten multiples-111,133, -222,266, -333,399, -444,532, -555,665, -666,798, -777,931, -889,064, -1,000,197, -1,111,330
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 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33
As a percentage & fraction
As a percentage-11,113,300%
-111,133% as a decimal-1,111.33
-111,133% of 100-111,133
-111,133% of 1,000-1,111,330
As a fraction of 100-111,133/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -111,133
Nerdulate something else
Nothing in mind? Surprise me · today’s page