Recognised as Number
-2,053
- Negative
- Odd
- 4 digits
-2,053 is an odd 4-digit integer and the negative of 2,053. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value2,053
Digit count4
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2,053
Distinct prime factors12,053
Number of divisors2
Sum of divisors σ(n)2,054
SquarefreeYesno repeated prime factor
All divisors1, 2,0532 in total
Arithmetic
Representations
Decimal-2,053
Binary10000000010112 bits
Octal4005
Hexadecimal805
Base 361L1
In wordsminus two thousand and fifty-three
Ordinalminus two thousand and fifty-third
Scientific notation-2.053 × 10^3
Engineering notation-2.053 × 10^3
In other bases
Ternary2211001base 3; the most digit-efficient integer base after e: 7 digits
Quinary31203base 5; one hand: 5 digits
Septenary5662base 7: 4 digits
Nonary2731base 9; each digit is two ternary digits: 4 digits
Duodecimal1231base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal52dbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal34:13base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT01TT00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011111111011
Bit length12 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits9within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes208 05
Gray code110000000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011111111011two's complement
32-bit11111111111111111111011111111011two's complement
64-bit1111111111111111111111111111111111111111111111111111011111111011two's complement
One's complement0000100000000100at 16 bits, every bit flipped
Bits reversed1101111111101111at 16 bits
Rotated left by 11110111111110111at 16 bits, wrapping
Shifted left by 1-1000000001010= -4,106, no wrap
Shifted right by 1-10000000011= -1,026, discarding the low bit
These bits as a double1.01431677 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,053 to the power 24,214,809
-2,053 to the power 3-8,653,002,877
-2,053 to the power 417,764,614,906,481
-2,053 to the power 5-36,470,754,403,005,493
First ten multiples-2,053, -4,106, -6,159, -8,212, -10,265, -12,318, -14,371, -16,424, -18,477, -20,530
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 53
As a percentage & fraction
As a percentage-205,300%
-2,053% as a decimal-20.53
-2,053% of 100-2,053
-2,053% of 1,000-20,530
As a fraction of 100-2,053/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,053
Nerdulate something else
Nothing in mind? Surprise me · today’s page