Nerdulator> put something in

Recognised as Number

-251

  • Negative
  • Odd
  • 3 digits

-251 is an odd 3-digit integer and the negative of 251. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value251
Digit count3
Digit sum8
Digit product10
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 × 251
Distinct prime factors1251
Number of divisors2
Sum of divisors σ(n)252
SquarefreeYesno repeated prime factor
All divisors1, 2512 in total

Arithmetic

Previous number-252
Next number-250
Double-502
Half-125.5
Square63,001
Cube root-6.307993549
Negation251
Reciprocal-0.0039840637

Representations

Decimal-251
Binary111110118 bits
Octal373
HexadecimalFB
Base 366Z
In wordsminus two hundred and fifty-one
Ordinalminus two hundred and fifty-first
Scientific notation-2.51 × 10^2
Engineering notation-251

In other bases

Ternary100022base 3; the most digit-efficient integer base after e — 6 digits
Quinary2001base 5; one hand — 4 digits
Septenary506base 7 — 3 digits
Nonary308base 9; each digit is two ternary digits — 3 digits
Duodecimal18bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 3 digits
Vigesimalcbbase 20; hands and feet, and the Mayan and Yoruba systems — 2 digits
Sexagesimal4:11base 60; Babylonian, and still how an hour and a circle are divided — 2 digits
Balanced ternaryT00T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111100000101
Bit length8 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits1within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 7worth 128
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes1fb
Gray code10000110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111111100000101two's complement
32-bit11111111111111111111111100000101two's complement
64-bit1111111111111111111111111111111111111111111111111111111100000101two's complement
One's complement0000000011111010at 16 bits, every bit flipped
Bits reversed1010000011111111at 16 bits
Rotated left by 11111111000001011at 16 bits, wrapping
Shifted left by 1-111110110= -502, no wrap
Shifted right by 1-1111110= -125, discarding the low bit
These bits as a double1.24010477 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+253
Nearest square below225
Nearest square above256

Powers & multiples

-251 to the power 263,001
-251 to the power 3-15,813,251
-251 to the power 43,969,126,001
-251 to the power 5-996,250,626,251
First ten multiples-251, -502, -753, -1,004, -1,255, -1,506, -1,757, -2,008, -2,259, -2,510
Powers of twoBetween 2^7 (128) and 2^8 (256)

Divisibility tests

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

As a percentage & fraction

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