Nerdulator> put something in

Recognised as Number

-9,257

  • Negative
  • Odd
  • 4 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value9,257
Digit count4
Digit sum23
Digit product630
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

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

Arithmetic

Previous number-9,258
Next number-9,256
Double-18,514
Cube root-20.996976133
Negation9,257
Reciprocal-0.0001080264

Representations

Decimal-9,257
Binary1001000010100114 bits
Octal22051
Hexadecimal2429
Base 36755
In wordsminus nine thousand, two hundred and fifty-seven
Ordinalminus nine thousand, two hundred and fifty-seventh
Scientific notation-9.257 × 10^3
Engineering notation-9.257 × 10^3

In other bases

Ternary110200212base 3; the most digit-efficient integer base after e: 9 digits
Quinary244012base 5; one hand: 6 digits
Septenary35663base 7: 5 digits
Nonary13625base 9; each digit is two ternary digits: 5 digits
Duodecimal5435base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal132hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:34:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTT10T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110000101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1101101111010111
Bit length14 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits9within that length
Bit parityodd5 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
Bytes224 29
Gray code11011000111101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101101111010111two's complement
32-bit11111111111111111101101111010111two's complement
64-bit1111111111111111111111111111111111111111111111111101101111010111two's complement
One's complement0010010000101000at 16 bits, every bit flipped
Bits reversed1110101111011011at 16 bits
Rotated left by 11011011110101111at 16 bits, wrapping
Shifted left by 1-100100001010010= -18,514, no wrap
Shifted right by 1-1001000010101= -4,628, discarding the low bit
These bits as a double4.57356568 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+9,259
Nearest square below9,216
Nearest square above9,409

Powers & multiples

-9,257 to the power 285,692,049
-9,257 to the power 3-793,251,297,593
-9,257 to the power 47,343,127,261,818,401
-9,257 to the power 5-67,975,329,062,652,938,057
First ten multiples-9,257, -18,514, -27,771, -37,028, -46,285, -55,542, -64,799, -74,056, -83,313, -92,570
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 57

As a percentage & fraction

As a percentage-925,700%
-9,257% as a decimal-92.57
-9,257% of 100-9,257
-9,257% of 1,000-92,570
As a fraction of 100-9,257/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 “-9257” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.