Recognised as Number
-2,132
- Negative
- Even
- 4 digits
-2,132 is an even 4-digit integer and the negative of 2,132. It has 12 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value2,132
Digit count4
Digit sum8
Digit product12
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 13 × 41
Distinct prime factors32, 13, 41
Number of divisors12
Sum of divisors σ(n)4,116
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 13, 26, 41, 52, 82, 164, 533, 1,066, 2,13212 in total
Arithmetic
Representations
Decimal-2,132
Binary10000101010012 bits
Octal4124
Hexadecimal854
Base 361N8
In wordsminus two thousand, one hundred and thirty-two
Ordinalminus two thousand, one hundred and thirty-second
Scientific notation-2.132 × 10^3
Engineering notation-2.132 × 10^3
In other bases
Ternary2220222base 3; the most digit-efficient integer base after e: 7 digits
Quinary32012base 5; one hand: 5 digits
Septenary6134base 7: 4 digits
Nonary2828base 9; each digit is two ternary digits: 4 digits
Duodecimal1298base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal56cbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal35:32base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT001T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011110101100
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 22 trailing zeros
Power of twoNo
Bytes208 54
Gray code110001111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011110101100two's complement
32-bit11111111111111111111011110101100two's complement
64-bit1111111111111111111111111111111111111111111111111111011110101100two's complement
One's complement0000100001010011at 16 bits, every bit flipped
Bits reversed0011010111101111at 16 bits
Rotated left by 11110111101011001at 16 bits, wrapping
Shifted left by 1-1000010101000= -4,264, no wrap
Shifted right by 1-10000101010= -1,066, discarding the low bit
These bits as a double1.05334796 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,132 to the power 24,545,424
-2,132 to the power 3-9,690,843,968
-2,132 to the power 420,660,879,339,776
-2,132 to the power 5-44,048,994,752,402,432
First ten multiples-2,132, -4,264, -6,396, -8,528, -10,660, -12,792, -14,924, -17,056, -19,188, -21,320
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 8
Divisible by 100No, remainder 32
As a percentage & fraction
As a percentage-213,200%
-2,132% as a decimal-21.32
-2,132% of 100-2,132
-2,132% of 1,000-21,320
As a fraction of 100-2,132/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,132
Nerdulate something else
Nothing in mind? Surprise me · today’s page