Nerdulator> put something in

Recognised as Number

-559

  • Negative
  • Odd
  • 3 digits

-559 is an odd 3-digit integer and the negative of 559. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value559
Digit count3
Digit sum19
Digit product225
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 13 × 43
Distinct prime factors213, 43
Number of divisors4
Sum of divisors σ(n)616
SquarefreeYesno repeated prime factor
All divisors1, 13, 43, 5594 in total

Arithmetic

Previous number-560
Next number-558
Double-1,118
Half-279.5
Square312,481
Cube root-8.237661384
Negation559
Reciprocal-0.0017889088

Representations

Decimal-559
Binary100010111110 bits
Octal1057
Hexadecimal22F
Base 36FJ
In wordsminus five hundred and fifty-nine
Ordinalminus five hundred and fifty-ninth
Scientific notation-5.59 × 10^2
Engineering notation-559

In other bases

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

Bit-level

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

At each machine width

16-bit1111110111010001two's complement
32-bit11111111111111111111110111010001two's complement
64-bit1111111111111111111111111111111111111111111111111111110111010001two's complement
One's complement0000001000101110at 16 bits, every bit flipped
Bits reversed1000101110111111at 16 bits
Rotated left by 11111101110100011at 16 bits, wrapping
Shifted left by 1-10001011110= -1,118, no wrap
Shifted right by 1-100011000= -279, discarding the low bit
These bits as a double2.76182696 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+561
Nearest square below529
Nearest square above576

Powers & multiples

-559 to the power 2312,481
-559 to the power 3-174,676,879
-559 to the power 497,644,375,361
-559 to the power 5-54,583,205,826,799
First ten multiples-559, -1,118, -1,677, -2,236, -2,795, -3,354, -3,913, -4,472, -5,031, -5,590
Powers of twoBetween 2^9 (512) and 2^10 (1,024)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 59

As a percentage & fraction

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