Recognised as Number
-2,322
- Negative
- Even
- 4 digits
-2,322 is an even 4-digit integer and the negative of 2,322. It has 16 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value2,322
Digit count4
Digit sum9
Digit product24
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3^3 × 43
Distinct prime factors32, 3, 43
Number of divisors16
Sum of divisors σ(n)5,280
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 27, 43, 54, 86, 129, 258, 387, 774, 1,161, 2,32216 in total
Arithmetic
Representations
Decimal-2,322
Binary10010001001012 bits
Octal4422
Hexadecimal912
Base 361SI
In wordsminus two thousand, three hundred and twenty-two
Ordinalminus two thousand, three hundred and twenty-second
Scientific notation-2.322 × 10^3
Engineering notation-2.322 × 10^3
In other bases
Ternary10012000base 3; the most digit-efficient integer base after e: 8 digits
Quinary33242base 5; one hand: 5 digits
Septenary6525base 7: 4 digits
Nonary3160base 9; each digit is two ternary digits: 4 digits
Duodecimal1416base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal5g2base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal38:42base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT0T11000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011011101110
Bit length12 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits8within that length
Bit parityeven4 set bits, so even; not the same as the number itself being even
Highest set bitbit 11worth 2,048
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes209 12
Gray code110110011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011011101110two's complement
32-bit11111111111111111111011011101110two's complement
64-bit1111111111111111111111111111111111111111111111111111011011101110two's complement
One's complement0000100100010001at 16 bits, every bit flipped
Bits reversed0111011101101111at 16 bits
Rotated left by 11110110111011101at 16 bits, wrapping
Shifted left by 1-1001000100100= -4,644, no wrap
Shifted right by 1-10010001001= -1,161, discarding the low bit
These bits as a double1.14722043 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,322 to the power 25,391,684
-2,322 to the power 3-12,519,490,248
-2,322 to the power 429,070,256,355,856
-2,322 to the power 5-67,501,135,258,297,632
First ten multiples-2,322, -4,644, -6,966, -9,288, -11,610, -13,932, -16,254, -18,576, -20,898, -23,220
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 6
Divisible by 100No, remainder 22
As a percentage & fraction
As a percentage-232,200%
-2,322% as a decimal-23.22
-2,322% of 100-2,322
-2,322% of 1,000-23,220
As a fraction of 100-2,322/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,322
Nerdulate something else
Nothing in mind? Surprise me · today’s page