Recognised as Number
-57
- Negative
- Odd
- 2 digits
-57 is an odd 2-digit integer and the negative of 57. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value57
Digit count2
Digit sum12
Digit product35
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 19
Distinct prime factors23, 19
Number of divisors4
Sum of divisors σ(n)80
SquarefreeYesno repeated prime factor
All divisors1, 3, 19, 574 in total
Arithmetic
Representations
Decimal-57
Binary1110016 bits
Octal71
Hexadecimal39
Base 361L
In wordsminus fifty-seven
Ordinalminus fifty-seventh
Scientific notation-5.7 × 10^1
Engineering notation-57
In other bases
Ternary2010base 3; the most digit-efficient integer base after e: 4 digits
Quinary212base 5; one hand: 3 digits
Septenary111base 7: 3 digits
Nonary63base 9; each digit is two ternary digits: 2 digits
Duodecimal49base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 2 digits
Vigesimal2hbase 20; hands and feet, and the Mayan and Yoruba systems: 2 digits
Sexagesimal57base 60; Babylonian, and still how an hour and a circle are divided: 1 digit
Balanced ternaryT10T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11000111
Bit length6 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits2within that length
Bit parityeven4 set bits, so even; not the same as the number itself being odd
Highest set bitbit 5worth 32
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes139
Gray code100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
8-bit11000111two's complement
16-bit1111111111000111two's complement
32-bit11111111111111111111111111000111two's complement
64-bit1111111111111111111111111111111111111111111111111111111111000111two's complement
One's complement00111000at 8 bits, every bit flipped
Bits reversed11100011at 8 bits
Rotated left by 110001111at 8 bits, wrapping
Shifted left by 1-1110010= -114, no wrap
Shifted right by 1-11101= -28, discarding the low bit
These bits as a double2.81617418 × 10^-322≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-57 to the power 23,249
-57 to the power 3-185,193
-57 to the power 410,556,001
-57 to the power 5-601,692,057
First ten multiples-57, -114, -171, -228, -285, -342, -399, -456, -513, -570
Powers of twoBetween 2^5 (32) and 2^6 (64)
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-5,700%
-57% as a decimal-0.57
-57% of 100-57
-57% of 1,000-570
As a fraction of 100-57/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -57
Nerdulate something else
Nothing in mind? Surprise me · today’s page