Nerdulator> put something in

Recognised as Number

-566

  • Negative
  • Even
  • 3 digits

-566 is an even 3-digit integer and the negative of 566. It has 4 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value566
Digit count3
Digit sum17
Digit product180
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 283
Distinct prime factors22, 283
Number of divisors4
Sum of divisors σ(n)852
SquarefreeYesno repeated prime factor
All divisors1, 2, 283, 5664 in total

Arithmetic

Previous number-567
Next number-565
Double-1,132
Half-283
Square320,356
Cube root-8.271903838
Negation566
Reciprocal-0.0017667845

Representations

Decimal-566
Binary100011011010 bits
Octal1066
Hexadecimal236
Base 36FQ
In wordsminus five hundred and sixty-six
Ordinalminus five hundred and sixty-sixth
Scientific notation-5.66 × 10^2
Engineering notation-566

In other bases

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

Bit-level

1111110111001010
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 even
Highest set bitbit 9worth 512
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes202 36
Gray code1100101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110111001010two's complement
32-bit11111111111111111111110111001010two's complement
64-bit1111111111111111111111111111111111111111111111111111110111001010two's complement
One's complement0000001000110101at 16 bits, every bit flipped
Bits reversed0101001110111111at 16 bits
Rotated left by 11111101110010101at 16 bits, wrapping
Shifted left by 1-10001101100= -1,132, no wrap
Shifted right by 1-100011011= -283, discarding the low bit
These bits as a double2.79641156 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+568
Nearest square below529
Nearest square above576

Powers & multiples

-566 to the power 2320,356
-566 to the power 3-181,321,496
-566 to the power 4102,627,966,736
-566 to the power 5-58,087,429,172,576
First ten multiples-566, -1,132, -1,698, -2,264, -2,830, -3,396, -3,962, -4,528, -5,094, -5,660
Powers of twoBetween 2^9 (512) and 2^10 (1,024)

Divisibility tests

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

As a percentage & fraction

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