Recognised as Number
-2,557
- Negative
- Odd
- 4 digits
-2,557 is an odd 4-digit integer and the negative of 2,557. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value2,557
Digit count4
Digit sum19
Digit product350
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2,557
Distinct prime factors12,557
Number of divisors2
Sum of divisors σ(n)2,558
SquarefreeYesno repeated prime factor
All divisors1, 2,5572 in total
Arithmetic
Representations
Decimal-2,557
Binary10011111110112 bits
Octal4775
Hexadecimal9FD
Base 361Z1
In wordsminus two thousand, five hundred and fifty-seven
Ordinalminus two thousand, five hundred and fifty-seventh
Scientific notation-2.557 × 10^3
Engineering notation-2.557 × 10^3
In other bases
Ternary10111201base 3; the most digit-efficient integer base after e: 8 digits
Quinary40212base 5; one hand: 5 digits
Septenary10312base 7: 5 digits
Nonary3451base 9; each digit is two ternary digits: 4 digits
Duodecimal1591base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal67hbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal42:37base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTT11110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111011000000011
Bit length12 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits3within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes209 fd
Gray code110100000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111011000000011two's complement
32-bit11111111111111111111011000000011two's complement
64-bit1111111111111111111111111111111111111111111111111111011000000011two's complement
One's complement0000100111111100at 16 bits, every bit flipped
Bits reversed1100000001101111at 16 bits
Rotated left by 11110110000000111at 16 bits, wrapping
Shifted left by 1-1001111111010= -5,114, no wrap
Shifted right by 1-10011111111= -1,278, discarding the low bit
These bits as a double1.26332586 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-2,557 to the power 26,538,249
-2,557 to the power 3-16,718,302,693
-2,557 to the power 442,748,699,986,001
-2,557 to the power 5-109,308,425,864,204,557
First ten multiples-2,557, -5,114, -7,671, -10,228, -12,785, -15,342, -17,899, -20,456, -23,013, -25,570
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-255,700%
-2,557% as a decimal-25.57
-2,557% of 100-2,557
-2,557% of 1,000-25,570
As a fraction of 100-2,557/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -2,557
Nerdulate something else
Nothing in mind? Surprise me · today’s page