Nerdulator> put something in

Recognised as Number

-591

  • Negative
  • Odd
  • 3 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value591
Digit count3
Digit sum15
Digit product45
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3 × 197
Distinct prime factors23, 197
Number of divisors4
Sum of divisors σ(n)792
SquarefreeYesno repeated prime factor
All divisors1, 3, 197, 5914 in total

Arithmetic

Previous number-592
Next number-590
Double-1,182
Half-295.5
Square349,281
Cube root-8.391942387
Negation591
Reciprocal-0.0016920474

Representations

Decimal-591
Binary100100111110 bits
Octal1117
Hexadecimal24F
Base 36GF
In wordsminus five hundred and ninety-one
Ordinalminus five hundred and ninety-first
Scientific notation-5.91 × 10^2
Engineering notation-591

In other bases

Ternary210220base 3; the most digit-efficient integer base after e: 6 digits
Quinary4331base 5; one hand: 4 digits
Septenary1503base 7: 4 digits
Nonary726base 9; each digit is two ternary digits: 3 digits
Duodecimal413base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal19bbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal9:51base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT1TT010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1011110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111110110110001
Bit length10 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits4within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 9worth 512
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes202 4f
Gray code1101101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111110110110001two's complement
32-bit11111111111111111111110110110001two's complement
64-bit1111111111111111111111111111111111111111111111111111110110110001two's complement
One's complement0000001001001110at 16 bits, every bit flipped
Bits reversed1000110110111111at 16 bits
Rotated left by 11111101101100011at 16 bits, wrapping
Shifted left by 1-10010011110= -1,182, no wrap
Shifted right by 1-100101000= -295, discarding the low bit
These bits as a double2.91992797 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+593
Nearest square below576
Nearest square above625

Powers & multiples

-591 to the power 2349,281
-591 to the power 3-206,425,071
-591 to the power 4121,997,216,961
-591 to the power 5-72,100,355,223,951
First ten multiples-591, -1,182, -1,773, -2,364, -2,955, -3,546, -4,137, -4,728, -5,319, -5,910
Powers of twoBetween 2^9 (512) and 2^10 (1,024)

Divisibility tests

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

As a percentage & fraction

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