Nerdulator> put something in

Recognised as Number

-19,231

  • Negative
  • Odd
  • 5 digits

-19,231 is an odd 5-digit integer and the negative of 19,231. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value19,231
Digit count5
Digit sum16
Digit product54
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 19,231
Distinct prime factors119,231
Number of divisors2
Sum of divisors σ(n)19,232
SquarefreeYesno repeated prime factor
All divisors1, 19,2312 in total

Arithmetic

Previous number-19,232
Next number-19,230
Double-38,462
Cube root-26.791721658
Negation19,231
Reciprocal-0.0000519994

Representations

Decimal-19,231
Binary10010110001111115 bits
Octal45437
Hexadecimal4B1F
Base 36EU7
In wordsminus nineteen thousand, two hundred and thirty-one
Ordinalminus nineteen thousand, two hundred and thirty-first
Scientific notation-1.9231 × 10^4
Engineering notation-19.231 × 10^3

In other bases

Ternary222101021base 3; the most digit-efficient integer base after e: 9 digits
Quinary1103411base 5; one hand: 7 digits
Septenary110032base 7: 6 digits
Nonary28337base 9; each digit is two ternary digits: 5 digits
Duodecimalb167base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal281bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:20:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT001T0TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111010100100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1011010011100001
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes24b 1f
Gray code110111010010000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1011010011100001two's complement
32-bit11111111111111111011010011100001two's complement
64-bit1111111111111111111111111111111111111111111111111011010011100001two's complement
One's complement0100101100011110at 16 bits, every bit flipped
Bits reversed1000011100101101at 16 bits
Rotated left by 10110100111000011at 16 bits, wrapping
Shifted left by 1-1001011000111110= -38,462, no wrap
Shifted right by 1-10010110010000= -9,615, discarding the low bit
These bits as a double9.50137644 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+19,233
Nearest square below19,044
Nearest square above19,321

Powers & multiples

-19,231 to the power 2369,831,361
-19,231 to the power 3-7,112,226,903,391
-19,231 to the power 4136,775,235,579,112,321
-19,231 to the power 5-2,630,324,555,421,909,045,151
First ten multiples-19,231, -38,462, -57,693, -76,924, -96,155, -115,386, -134,617, -153,848, -173,079, -192,310
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,923,100%
-19,231% as a decimal-192.31
-19,231% of 100-19,231
-19,231% of 1,000-192,310
As a fraction of 100-19,231/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 “-19231” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.