Recognised as Number
-2,596
- Negative
- Even
- 4 digits
-2,596 is an even 4-digit integer and the negative of 2,596. It has 12 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value2,596
Digit count4
Digit sum22
Digit product540
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 11 × 59
Distinct prime factors32, 11, 59
Number of divisors12
Sum of divisors σ(n)5,040
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 44, 59, 118, 236, 649, 1,298, 2,59612 in total
Arithmetic
Representations
Decimal-2,596
Binary10100010010012 bits
Octal5044
HexadecimalA24
Base 36204
In wordsminus two thousand, five hundred and ninety-six
Ordinalminus two thousand, five hundred and ninety-sixth
Scientific notation-2.596 × 10^3
Engineering notation-2.596 × 10^3
In other bases
Ternary10120011base 3; the most digit-efficient integer base after e: 8 digits
Quinary40341base 5; one hand: 5 digits
Septenary10366base 7: 5 digits
Nonary3504base 9; each digit is two ternary digits: 4 digits
Duodecimal1604base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal69gbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal43:16base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTT1100TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111010111011100
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
Bytes20a 24
Gray code111100110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111010111011100two's complement
32-bit11111111111111111111010111011100two's complement
64-bit1111111111111111111111111111111111111111111111111111010111011100two's complement
One's complement0000101000100011at 16 bits, every bit flipped
Bits reversed0011101110101111at 16 bits
Rotated left by 11110101110111001at 16 bits, wrapping
Shifted left by 1-1010001001000= -5,192, no wrap
Shifted right by 1-10100010010= -1,298, discarding the low bit
These bits as a double1.28259442 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,596 to the power 26,739,216
-2,596 to the power 3-17,495,004,736
-2,596 to the power 445,417,032,294,656
-2,596 to the power 5-117,902,615,836,926,976
First ten multiples-2,596, -5,192, -7,788, -10,384, -12,980, -15,576, -18,172, -20,768, -23,364, -25,960
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11Yes
Divisible by 12No, remainder 4
Divisible by 100No, remainder 96
As a percentage & fraction
As a percentage-259,600%
-2,596% as a decimal-25.96
-2,596% of 100-2,596
-2,596% of 1,000-25,960
As a fraction of 100-2,596/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,596
Nerdulate something else
Nothing in mind? Surprise me · today’s page