Nerdulator> put something in

Recognised as Number

-6

  • Negative
  • Even
  • 1 digit

-6 is an even 1-digit integer and the negative of 6. It has 4 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value6
Digit count1
Digit sum6
Digit product6
Digital root6repeated digit sum
PalindromicYesreads the same backwards

Factors & divisors

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

Arithmetic

Previous number-7
Next number-5
Double-12
Half-3
Square36
Cube-216
Cube root-1.817120593≈
Negation6
Reciprocal-0.1666666667≈

Representations

Decimal-6
Binary1103 bits
Octal6
Hexadecimal6
Base 366
In wordsminus six
Ordinalminus sixth
Scientific notation-6 × 10^0
Engineering notation-6

In other bases

Ternary20base 3; the most digit-efficient integer base after e: 2 digits
Quinary11base 5; one hand: 2 digits
Septenary6base 7: 1 digit
Nonary6base 9; each digit is two ternary digits: 1 digit
Duodecimal6base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 1 digit
Vigesimal6base 20; hands and feet, and the Mayan and Yoruba systems: 1 digit
Sexagesimal6base 60; Babylonian, and still how an hour and a circle are divided: 1 digit
Balanced ternaryT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111010
Bit length3 bitsto write the magnitude
Set bits2the population count, or Hamming weight
Zero bits1within that length
Bit parityeven2 set bits, so even; not the same as the number itself being even
Highest set bitbit 2worth 4
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes106
Gray code101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

8-bit11111010two's complement
16-bit1111111111111010two's complement
32-bit11111111111111111111111111111010two's complement
64-bit1111111111111111111111111111111111111111111111111111111111111010two's complement
One's complement00000101at 8 bits, every bit flipped
Bits reversed01011111at 8 bits
Rotated left by 111110101at 8 bits, wrapping
Shifted left by 1-1100= -12, no wrap
Shifted right by 1-11= -3, discarding the low bit
These bits as a double2.96439388 × 10^-323≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+8
Nearest square below4
Nearest square above9

Powers & multiples

-6 to the power 236
-6 to the power 3-216
-6 to the power 41,296
-6 to the power 5-7,776
First ten multiples-6, -12, -18, -24, -30, -36, -42, -48, -54, -60
Powers of twoBetween 2^2 (4) and 2^3 (8)

Divisibility tests

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

As a percentage & fraction

As a percentage-600%
-6% as a decimal-0.06
-6% of 100-6
-6% of 1,000-60
As a fraction of 100-6/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Neighbouring numbers

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “-6” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.