Recognised as Number
-109,322
- Negative
- Even
- 6 digits
-109,322 is an even 6-digit integer and the negative of 109,322. It has 8 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value109,322
Digit count6
Digit sum17
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 × 2 × 47 × 1,163
Distinct prime factors32, 47, 1,163
Number of divisors8
Sum of divisors σ(n)167,616
SquarefreeYesno repeated prime factor
All divisors1, 2, 47, 94, 1,163, 2,326, 54,661, 109,3228 in total
Arithmetic
Representations
Decimal-109,322
Binary1101010110000101017 bits
Octal325412
Hexadecimal1AB0A
Base 362CCQ
In wordsminus one hundred and nine thousand, three hundred and twenty-two
Ordinalminus one hundred and nine thousand, three hundred and twenty-second
Scientific notation-1.09322 × 10^5
Engineering notation-109.322 × 10^3
In other bases
Ternary12112221222base 3; the most digit-efficient integer base after e: 11 digits
Quinary11444242base 5; one hand: 8 digits
Septenary633503base 7: 6 digits
Nonary175858base 9; each digit is two ternary digits: 6 digits
Duodecimal53322base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldd62base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:22:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10110001001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101010100001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101010011110110
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 ab 0a
Gray code10111111010001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101010011110110two's complement
64-bit1111111111111111111111111111111111111111111111100101010011110110two's complement
One's complement00000000000000011010101100001001at 32 bits, every bit flipped
Bits reversed01101111001010100111111111111111at 32 bits
Rotated left by 111111111111111001010100111101101at 32 bits, wrapping
Shifted left by 1-110101011000010100= -218,644, no wrap
Shifted right by 1-1101010110000101= -54,661, discarding the low bit
These bits as a double5.40122445 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-109,322 to the power 211,951,299,684
-109,322 to the power 3-1,306,539,984,054,248
-109,322 to the power 4142,833,564,136,778,499,856
-109,322 to the power 5-15,614,850,898,560,899,161,257,632
First ten multiples-109,322, -218,644, -327,966, -437,288, -546,610, -655,932, -765,254, -874,576, -983,898, -1,093,220
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 2
Divisible by 100No, remainder 22
As a percentage & fraction
As a percentage-10,932,200%
-109,322% as a decimal-1,093.22
-109,322% of 100-109,322
-109,322% of 1,000-1,093,220
As a fraction of 100-109,322/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -109,322
Nerdulate something else
Nothing in mind? Surprise me · today’s page