Nerdulator> put something in

Recognised as Number

-5

  • Negative
  • Odd
  • 1 digit

-5 is an odd 1-digit integer and the negative of 5. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value5
Digit count1
Digit sum5
Digit product5
Digital root5repeated digit sum
PalindromicYesreads the same backwards

Factors & divisors

Prime factorisation−1 × 5
Distinct prime factors15
Number of divisors2
Sum of divisors σ(n)6
SquarefreeYesno repeated prime factor
All divisors1, 52 in total

Arithmetic

Previous number-6
Next number-4
Double-10
Half-2.5
Square25
Cube-125
Cube root-1.709975947≈
Negation5
Reciprocal-0.2≈

Representations

Decimal-5
Binary1013 bits
Octal5
Hexadecimal5
Base 365
In wordsminus five
Ordinalminus fifth
Scientific notation-5 × 10^0
Engineering notation-5

In other bases

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

Bit-level

11111011
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 odd
Highest set bitbit 2worth 4
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes105
Gray code111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

8-bit11111011two's complement
16-bit1111111111111011two's complement
32-bit11111111111111111111111111111011two's complement
64-bit1111111111111111111111111111111111111111111111111111111111111011two's complement
One's complement00000100at 8 bits, every bit flipped
Bits reversed11011111at 8 bits
Rotated left by 111110111at 8 bits, wrapping
Shifted left by 1-1010= -10, no wrap
Shifted right by 1-11= -2, discarding the low bit
These bits as a double2.47032823 × 10^-323≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+7
Nearest square below4
Nearest square above9

Powers & multiples

-5 to the power 225
-5 to the power 3-125
-5 to the power 4625
-5 to the power 5-3,125
First ten multiples-5, -10, -15, -20, -25, -30, -35, -40, -45, -50
Powers of twoBetween 2^2 (4) and 2^3 (8)

Divisibility tests

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

As a percentage & fraction

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