Recognised as Number
-9,057
- Negative
- Odd
- 4 digits
-9,057 is an odd 4-digit integer and the negative of 9,057. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value9,057
Digit count4
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 3,019
Distinct prime factors23, 3,019
Number of divisors4
Sum of divisors σ(n)12,080
SquarefreeYesno repeated prime factor
All divisors1, 3, 3,019, 9,0574 in total
Arithmetic
Previous number-9,058
Next number-9,056
Double-18,114
Half-4,528.5
Square82,029,249
Cube-742,938,908,193
Cube root-20.844658731≈
Negation9,057
Reciprocal-0.0001104118≈
Representations
Decimal-9,057
Binary1000110110000114 bits
Octal21541
Hexadecimal2361
Base 366ZL
In wordsminus nine thousand and fifty-seven
Ordinalminus nine thousand and fifty-seventh
Scientific notation-9.057 × 10^3
Engineering notation-9.057 × 10^3
In other bases
Ternary110102110base 3; the most digit-efficient integer base after e: 9 digits
Quinary242212base 5; one hand: 6 digits
Septenary35256base 7: 5 digits
Nonary13373base 9; each digit is two ternary digits: 5 digits
Duodecimal52a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal12chbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:30:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT0TT1TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10110111100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101110010011111
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
Bytes223 61
Gray code11001011010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101110010011111two's complement
32-bit11111111111111111101110010011111two's complement
64-bit1111111111111111111111111111111111111111111111111101110010011111two's complement
One's complement0010001101100000at 16 bits, every bit flipped
Bits reversed1111100100111011at 16 bits
Rotated left by 11011100100111111at 16 bits, wrapping
Shifted left by 1-100011011000010= -18,114, no wrap
Shifted right by 1-1000110110001= -4,528, discarding the low bit
These bits as a double4.47475255 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-9,057 to the power 282,029,249
-9,057 to the power 3-742,938,908,193
-9,057 to the power 46,728,797,691,504,001
-9,057 to the power 5-60,942,720,691,951,737,057
First ten multiples-9,057, -18,114, -27,171, -36,228, -45,285, -54,342, -63,399, -72,456, -81,513, -90,570
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-905,700%
-9,057% as a decimal-90.57
-9,057% of 100-9,057
-9,057% of 1,000-90,570
As a fraction of 100-9,057/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -9,057
Nerdulate something else
Nothing in mind? Surprise me · today’s page