Recognised as Number
-110,321
- Negative
- Odd
- 6 digits
-110,321 is an odd 6-digit integer and the negative of 110,321. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value110,321
Digit count6
Digit sum8
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 110,321
Distinct prime factors1110,321
Number of divisors2
Sum of divisors σ(n)110,322
SquarefreeYesno repeated prime factor
All divisors1, 110,3212 in total
Arithmetic
Representations
Decimal-110,321
Binary1101011101111000117 bits
Octal327361
Hexadecimal1AEF1
Base 362D4H
In wordsminus one hundred and ten thousand, three hundred and twenty-one
Ordinalminus one hundred and ten thousand, three hundred and twenty-first
Scientific notation-1.10321 × 10^5
Engineering notation-110.321 × 10^3
In other bases
Ternary12121022222base 3; the most digit-efficient integer base after e: 11 digits
Quinary12012241base 5; one hand: 8 digits
Septenary636431base 7: 6 digits
Nonary177288base 9; each digit is two ternary digits: 6 digits
Duodecimal53a15base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldfg1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:38:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1011TT00001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101000100010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101000100001111
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 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 ae f1
Gray code10111100110001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101000100001111two's complement
64-bit1111111111111111111111111111111111111111111111100101000100001111two's complement
One's complement00000000000000011010111011110000at 32 bits, every bit flipped
Bits reversed11110000100010100111111111111111at 32 bits
Rotated left by 111111111111111001010001000011111at 32 bits, wrapping
Shifted left by 1-110101110111100010= -220,642, no wrap
Shifted right by 1-1101011101111001= -55,160, discarding the low bit
These bits as a double5.45058161 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-110,321 to the power 212,170,723,041
-110,321 to the power 3-1,342,686,336,606,161
-110,321 to the power 4148,126,499,340,728,287,681
-110,321 to the power 5-16,341,463,533,768,485,425,255,601
First ten multiples-110,321, -220,642, -330,963, -441,284, -551,605, -661,926, -772,247, -882,568, -992,889, -1,103,210
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-11,032,100%
-110,321% as a decimal-1,103.21
-110,321% of 100-110,321
-110,321% of 1,000-1,103,210
As a fraction of 100-110,321/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -110,321
Nerdulate something else
Nothing in mind? Surprise me · today’s page