Recognised as Number
-2,682
- Negative
- Even
- 4 digits
-2,682 is an even 4-digit integer and the negative of 2,682. It has 12 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value2,682
Digit count4
Digit sum18
Digit product192
Multiplicative persistence3times 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^2 × 149
Distinct prime factors32, 3, 149
Number of divisors12
Sum of divisors σ(n)5,850
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 149, 298, 447, 894, 1,341, 2,68212 in total
Arithmetic
Representations
Decimal-2,682
Binary10100111101012 bits
Octal5172
HexadecimalA7A
Base 3622I
In wordsminus two thousand, six hundred and eighty-two
Ordinalminus two thousand, six hundred and eighty-second
Scientific notation-2.682 × 10^3
Engineering notation-2.682 × 10^3
In other bases
Ternary10200100base 3; the most digit-efficient integer base after e: 8 digits
Quinary41212base 5; one hand: 5 digits
Septenary10551base 7: 5 digits
Nonary3610base 9; each digit is two ternary digits: 4 digits
Duodecimal1676base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal6e2base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal44:42base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTT100T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111010110000110
Bit length12 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits5within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 11worth 2,048
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes20a 7a
Gray code111101000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111010110000110two's complement
32-bit11111111111111111111010110000110two's complement
64-bit1111111111111111111111111111111111111111111111111111010110000110two's complement
One's complement0000101001111001at 16 bits, every bit flipped
Bits reversed0110000110101111at 16 bits
Rotated left by 11110101100001101at 16 bits, wrapping
Shifted left by 1-1010011110100= -5,364, no wrap
Shifted right by 1-10100111101= -1,341, discarding the low bit
These bits as a double1.32508406 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,682 to the power 27,193,124
-2,682 to the power 3-19,291,958,568
-2,682 to the power 451,741,032,879,376
-2,682 to the power 5-138,769,450,182,486,432
First ten multiples-2,682, -5,364, -8,046, -10,728, -13,410, -16,092, -18,774, -21,456, -24,138, -26,820
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 1
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 82
As a percentage & fraction
As a percentage-268,200%
-2,682% as a decimal-26.82
-2,682% of 100-2,682
-2,682% of 1,000-26,820
As a fraction of 100-2,682/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,682
Nerdulate something else
Nothing in mind? Surprise me · today’s page