Recognised as Number
-111,321
- Negative
- Odd
- 6 digits
-111,321 is an odd 6-digit integer and the negative of 111,321. It has 32 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value111,321
Digit count6
Digit sum9
Digit product6
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^3 × 7 × 19 × 31
Distinct prime factors43, 7, 19, 31
Number of divisors32
Sum of divisors σ(n)204,800
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 19, 21, 27, 31, 57, 63, 93, 133, 171, 189, 217, 279, 399, 513, 589, 651, 837, 1,197, 1,767, 1,953, 3,591, 4,123, 5,301, 5,859, 12,369, 15,903, 37,107, 111,32132 in total
Arithmetic
Representations
Decimal-111,321
Binary1101100101101100117 bits
Octal331331
Hexadecimal1B2D9
Base 362DW9
In wordsminus one hundred and eleven thousand, three hundred and twenty-one
Ordinalminus one hundred and eleven thousand, three hundred and twenty-first
Scientific notation-1.11321 × 10^5
Engineering notation-111.321 × 10^3
In other bases
Ternary12122201000base 3; the most digit-efficient integer base after e: 11 digits
Quinary12030241base 5; one hand: 8 digits
Septenary642360base 7: 6 digits
Nonary178630base 9; each digit is two ternary digits: 6 digits
Duodecimal54509base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldi61base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:55:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1010010T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101110101111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100110100100111
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 set bits, so even; 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 d9
Gray code10110101110110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100110100100111two's complement
64-bit1111111111111111111111111111111111111111111111100100110100100111two's complement
One's complement00000000000000011011001011011000at 32 bits, every bit flipped
Bits reversed11100100101100100111111111111111at 32 bits
Rotated left by 111111111111111001001101001001111at 32 bits, wrapping
Shifted left by 1-110110010110110010= -222,642, no wrap
Shifted right by 1-1101100101101101= -55,660, discarding the low bit
These bits as a double5.49998818 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-111,321 to the power 212,392,365,041
-111,321 to the power 3-1,379,530,468,729,161
-111,321 to the power 4153,570,711,309,398,931,681
-111,321 to the power 5-17,095,645,153,673,598,473,660,601
First ten multiples-111,321, -222,642, -333,963, -445,284, -556,605, -667,926, -779,247, -890,568, -1,001,889, -1,113,210
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 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-11,132,100%
-111,321% as a decimal-1,113.21
-111,321% of 100-111,321
-111,321% of 1,000-1,113,210
As a fraction of 100-111,321/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -111,321
Nerdulate something else
Nothing in mind? Surprise me · today’s page