Nerdulator> put something in

Recognised as Number

-261

  • Negative
  • Odd
  • 3 digits

-261 is an odd 3-digit integer and the negative of 261. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value261
Digit count3
Digit sum9
Digit product12
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3^2 × 29
Distinct prime factors23, 29
Number of divisors6
Sum of divisors σ(n)390
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 29, 87, 2616 in total

Arithmetic

Previous number-262
Next number-260
Double-522
Half-130.5
Square68,121
Cube root-6.390676528
Negation261
Reciprocal-0.0038314176

Representations

Decimal-261
Binary1000001019 bits
Octal405
Hexadecimal105
Base 3679
In wordsminus two hundred and sixty-one
Ordinalminus two hundred and sixty-first
Scientific notation-2.61 × 10^2
Engineering notation-261

In other bases

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

Bit-level

1111111011111011
Bit length9 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits6within that length
Bit parityodd3 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 8worth 256
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes201 05
Gray code110000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111111011111011two's complement
32-bit11111111111111111111111011111011two's complement
64-bit1111111111111111111111111111111111111111111111111111111011111011two's complement
One's complement0000000100000100at 16 bits, every bit flipped
Bits reversed1101111101111111at 16 bits
Rotated left by 11111110111110111at 16 bits, wrapping
Shifted left by 1-1000001010= -522, no wrap
Shifted right by 1-10000011= -130, discarding the low bit
These bits as a double1.28951134 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+263
Nearest square below256
Nearest square above289

Powers & multiples

-261 to the power 268,121
-261 to the power 3-17,779,581
-261 to the power 44,640,470,641
-261 to the power 5-1,211,162,837,301
First ten multiples-261, -522, -783, -1,044, -1,305, -1,566, -1,827, -2,088, -2,349, -2,610
Powers of twoBetween 2^8 (256) and 2^9 (512)

Divisibility tests

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

As a percentage & fraction

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