Nerdulator> put something in

Recognised as Number

-50

  • Negative
  • Even
  • 2 digits

-50 is an even 2-digit integer and the negative of 50. It has 6 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value50
Digit count2
Digit sum5
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 5^2
Distinct prime factors22, 5
Number of divisors6
Sum of divisors σ(n)93
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 25, 506 in total

Arithmetic

Previous number-51
Next number-49
Double-100
Half-25
Square2,500
Cube root-3.684031499
Negation50
Reciprocal-0.02

Representations

Decimal-50
Binary1100106 bits
Octal62
Hexadecimal32
Base 361E
In wordsminus fifty
Ordinalminus fiftieth
Scientific notation-5 × 10^1
Engineering notation-50

In other bases

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

Bit-level

11001110
Bit length6 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits3within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being even
Highest set bitbit 5worth 32
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes132
Gray code101011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

8-bit11001110two's complement
16-bit1111111111001110two's complement
32-bit11111111111111111111111111001110two's complement
64-bit1111111111111111111111111111111111111111111111111111111111001110two's complement
One's complement00110001at 8 bits, every bit flipped
Bits reversed01110011at 8 bits
Rotated left by 110011101at 8 bits, wrapping
Shifted left by 1-1100100= -100, no wrap
Shifted right by 1-11001= -25, discarding the low bit
These bits as a double2.47032823 × 10^-322IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+52
Nearest square below49
Nearest square above64

Powers & multiples

-50 to the power 22,500
-50 to the power 3-125,000
-50 to the power 46,250,000
-50 to the power 5-312,500,000
First ten multiples-50, -100, -150, -200, -250, -300, -350, -400, -450, -500
Powers of twoBetween 2^5 (32) and 2^6 (64)

Divisibility tests

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

As a percentage & fraction

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