Nerdulator> put something in

Recognised as Number

-9,209

  • Negative
  • Odd
  • 4 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value9,209
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,209
Distinct prime factors19,209
Number of divisors2
Sum of divisors σ(n)9,210
SquarefreeYesno repeated prime factor
All divisors1, 9,2092 in total

Arithmetic

Previous number-9,210
Next number-9,208
Double-18,418
Cube root-20.960621595
Negation9,209
Reciprocal-0.0001085894

Representations

Decimal-9,209
Binary1000111111100114 bits
Octal21771
Hexadecimal23F9
Base 3673T
In wordsminus nine thousand, two hundred and nine
Ordinalminus nine thousand, two hundred and ninth
Scientific notation-9.209 × 10^3
Engineering notation-9.209 × 10^3

In other bases

Ternary110122002base 3; the most digit-efficient integer base after e: 9 digits
Quinary243314base 5; one hand: 6 digits
Septenary35564base 7: 5 digits
Nonary13562base 9; each digit is two ternary digits: 5 digits
Duodecimal53b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal1309base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:33:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTT1010T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101110000000111
Bit length14 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits5within that length
Bit parityodd9 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
Bytes223 f9
Gray code11001000000101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101110000000111two's complement
32-bit11111111111111111101110000000111two's complement
64-bit1111111111111111111111111111111111111111111111111101110000000111two's complement
One's complement0010001111111000at 16 bits, every bit flipped
Bits reversed1110000000111011at 16 bits
Rotated left by 11011100000001111at 16 bits, wrapping
Shifted left by 1-100011111110010= -18,418, no wrap
Shifted right by 1-1000111111101= -4,604, discarding the low bit
These bits as a double4.54985053 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+9,211
Nearest square below9,025
Nearest square above9,216

Powers & multiples

-9,209 to the power 284,805,681
-9,209 to the power 3-780,975,516,329
-9,209 to the power 47,192,003,529,873,761
-9,209 to the power 5-66,231,160,506,607,465,049
First ten multiples-9,209, -18,418, -27,627, -36,836, -46,045, -55,254, -64,463, -73,672, -82,881, -92,090
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9

As a percentage & fraction

As a percentage-920,900%
-9,209% as a decimal-92.09
-9,209% of 100-9,209
-9,209% of 1,000-92,090
As a fraction of 100-9,209/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 “-9209” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.