Nerdulator> put something in

Recognised as Number

-557

  • Negative
  • Odd
  • 3 digits

-557 is an odd 3-digit integer and the negative of 557. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value557
Digit count3
Digit sum17
Digit product175
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 557
Distinct prime factors1557
Number of divisors2
Sum of divisors σ(n)558
SquarefreeYesno repeated prime factor
All divisors1, 5572 in total

Arithmetic

Previous number-558
Next number-556
Double-1,114
Half-278.5
Square310,249
Cube root-8.227825361
Negation557
Reciprocal-0.0017953321

Representations

Decimal-557
Binary100010110110 bits
Octal1055
Hexadecimal22D
Base 36FH
In wordsminus five hundred and fifty-seven
Ordinalminus five hundred and fifty-seventh
Scientific notation-5.57 × 10^2
Engineering notation-557

In other bases

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

Bit-level

1111110111010011
Bit length10 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits5within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 9worth 512
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes202 2d
Gray code1100111011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110111010011two's complement
32-bit11111111111111111111110111010011two's complement
64-bit1111111111111111111111111111111111111111111111111111110111010011two's complement
One's complement0000001000101100at 16 bits, every bit flipped
Bits reversed1100101110111111at 16 bits
Rotated left by 11111101110100111at 16 bits, wrapping
Shifted left by 1-10001011010= -1,114, no wrap
Shifted right by 1-100010111= -278, discarding the low bit
These bits as a double2.75194565 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+559
Nearest square below529
Nearest square above576

Powers & multiples

-557 to the power 2310,249
-557 to the power 3-172,808,693
-557 to the power 496,254,442,001
-557 to the power 5-53,613,724,194,557
First ten multiples-557, -1,114, -1,671, -2,228, -2,785, -3,342, -3,899, -4,456, -5,013, -5,570
Powers of twoBetween 2^9 (512) and 2^10 (1,024)

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

As a percentage & fraction

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