Nerdulator> put something in

Recognised as Number

-9,133

  • Negative
  • Odd
  • 4 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value9,133
Digit count4
Digit sum16
Digit product81
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

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

Arithmetic

Previous number-9,134
Next number-9,132
Double-18,266
Cube root-20.902800995
Negation9,133
Reciprocal-0.000109493

Representations

Decimal-9,133
Binary1000111010110114 bits
Octal21655
Hexadecimal23AD
Base 3671P
In wordsminus nine thousand, one hundred and thirty-three
Ordinalminus nine thousand, one hundred and thirty-third
Scientific notation-9.133 × 10^3
Engineering notation-9.133 × 10^3

In other bases

Ternary110112021base 3; the most digit-efficient integer base after e: 9 digits
Quinary243013base 5; one hand: 6 digits
Septenary35425base 7: 5 digits
Nonary13467base 9; each digit is two ternary digits: 5 digits
Duodecimal5351base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal12gdbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:32:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTT111T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110001010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101110001010011
Bit length14 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits6within that length
Bit parityeven8 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
Bytes223 ad
Gray code11001001111011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101110001010011two's complement
32-bit11111111111111111101110001010011two's complement
64-bit1111111111111111111111111111111111111111111111111101110001010011two's complement
One's complement0010001110101100at 16 bits, every bit flipped
Bits reversed1100101000111011at 16 bits
Rotated left by 11011100010100111at 16 bits, wrapping
Shifted left by 1-100011101011010= -18,266, no wrap
Shifted right by 1-1000111010111= -4,566, discarding the low bit
These bits as a double4.51230154 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

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

Powers & multiples

-9,133 to the power 283,411,689
-9,133 to the power 3-761,798,955,637
-9,133 to the power 46,957,509,861,832,721
-9,133 to the power 5-63,542,937,568,118,240,893
First ten multiples-9,133, -18,266, -27,399, -36,532, -45,665, -54,798, -63,931, -73,064, -82,197, -91,330
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

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 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33

As a percentage & fraction

As a percentage-913,300%
-9,133% as a decimal-91.33
-9,133% of 100-9,133
-9,133% of 1,000-91,330
As a fraction of 100-9,133/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 “-9133” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.