Nerdulator> put something in

Recognised as Number

-9,803

  • Negative
  • Odd
  • 4 digits

-9,803 is an odd 4-digit integer and the negative of 9,803. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value9,803
Digit count4
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 9,803
Distinct prime factors19,803
Number of divisors2
Sum of divisors σ(n)9,804
SquarefreeYesno repeated prime factor
All divisors1, 9,8032 in total

Arithmetic

Previous number-9,804
Next number-9,802
Double-19,606
Cube root-21.401933036
Negation9,803
Reciprocal-0.0001020096

Representations

Decimal-9,803
Binary1001100100101114 bits
Octal23113
Hexadecimal264B
Base 367KB
In wordsminus nine thousand, eight hundred and three
Ordinalminus nine thousand, eight hundred and third
Scientific notation-9.803 × 10^3
Engineering notation-9.803 × 10^3

In other bases

Ternary111110002base 3; the most digit-efficient integer base after e: 9 digits
Quinary303203base 5; one hand: 6 digits
Septenary40403base 7: 5 digits
Nonary14402base 9; each digit is two ternary digits: 5 digits
Duodecimal580bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal14a3base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:43:23base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTTTT00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10111011110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101100110110101
Bit length14 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits7within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes226 4b
Gray code11010101101110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101100110110101two's complement
32-bit11111111111111111101100110110101two's complement
64-bit1111111111111111111111111111111111111111111111111101100110110101two's complement
One's complement0010011001001010at 16 bits, every bit flipped
Bits reversed1010110110011011at 16 bits
Rotated left by 11011001101101011at 16 bits, wrapping
Shifted left by 1-100110010010110= -19,606, no wrap
Shifted right by 1-1001100100110= -4,901, discarding the low bit
These bits as a double4.84332553 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+9,805
Nearest square below9,801
Nearest square above10,000

Powers & multiples

-9,803 to the power 296,098,809
-9,803 to the power 3-942,056,624,627
-9,803 to the power 49,234,981,091,218,481
-9,803 to the power 5-90,530,519,637,214,769,243
First ten multiples-9,803, -19,606, -29,409, -39,212, -49,015, -58,818, -68,621, -78,424, -88,227, -98,030
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 3

As a percentage & fraction

As a percentage-980,300%
-9,803% as a decimal-98.03
-9,803% of 100-9,803
-9,803% of 1,000-98,030
As a fraction of 100-9,803/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “-9803” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.