Nerdulator> put something in

Recognised as Number

-9,509

  • Negative
  • Odd
  • 4 digits

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

Number properties

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

Factors & divisors

Prime factorisation−1 × 37 × 257
Distinct prime factors237, 257
Number of divisors4
Sum of divisors σ(n)9,804
SquarefreeYesno repeated prime factor
All divisors1, 37, 257, 9,5094 in total

Arithmetic

Previous number-9,510
Next number-9,508
Double-19,018
Cube root-21.185803953
Negation9,509
Reciprocal-0.0001051635

Representations

Decimal-9,509
Binary1001010010010114 bits
Octal22445
Hexadecimal2525
Base 367C5
In wordsminus nine thousand, five hundred and nine
Ordinalminus nine thousand, five hundred and ninth
Scientific notation-9.509 × 10^3
Engineering notation-9.509 × 10^3

In other bases

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

Bit-level

1101101011011011
Bit length14 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits8within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes225 25
Gray code11011110110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101101011011011two's complement
32-bit11111111111111111101101011011011two's complement
64-bit1111111111111111111111111111111111111111111111111101101011011011two's complement
One's complement0010010100100100at 16 bits, every bit flipped
Bits reversed1101101101011011at 16 bits
Rotated left by 11011010110110111at 16 bits, wrapping
Shifted left by 1-100101001001010= -19,018, no wrap
Shifted right by 1-1001010010011= -4,754, discarding the low bit
These bits as a double4.69807023 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+9,511
Nearest square below9,409
Nearest square above9,604

Powers & multiples

-9,509 to the power 290,421,081
-9,509 to the power 3-859,814,059,229
-9,509 to the power 48,175,971,889,208,561
-9,509 to the power 5-77,745,316,694,484,206,549
First ten multiples-9,509, -19,018, -28,527, -38,036, -47,545, -57,054, -66,563, -76,072, -85,581, -95,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 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9

As a percentage & fraction

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