Nerdulator> put something in

Recognised as Number

-15,837

  • Negative
  • Odd
  • 5 digits

-15,837 is an odd 5-digit integer and the negative of 15,837. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value15,837
Digit count5
Digit sum24
Digit product840
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3 × 5,279
Distinct prime factors23, 5,279
Number of divisors4
Sum of divisors σ(n)21,120
SquarefreeYesno repeated prime factor
All divisors1, 3, 5,279, 15,8374 in total

Arithmetic

Previous number-15,838
Next number-15,836
Double-31,674
Cube root-25.112559124
Negation15,837
Reciprocal-0.0000631433

Representations

Decimal-15,837
Binary1111011101110114 bits
Octal36735
Hexadecimal3DDD
Base 36C7X
In wordsminus fifteen thousand, eight hundred and thirty-seven
Ordinalminus fifteen thousand, eight hundred and thirty-seventh
Scientific notation-1.5837 × 10^4
Engineering notation-15.837 × 10^3

In other bases

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

Bit-level

1100001000100011
Bit length14 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits3within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes23d dd
Gray code10001100110011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1100001000100011two's complement
32-bit11111111111111111100001000100011two's complement
64-bit1111111111111111111111111111111111111111111111111100001000100011two's complement
One's complement0011110111011100at 16 bits, every bit flipped
Bits reversed1100010001000011at 16 bits
Rotated left by 11000010001000111at 16 bits, wrapping
Shifted left by 1-111101110111010= -31,674, no wrap
Shifted right by 1-1111011101111= -7,918, discarding the low bit
These bits as a double7.82451763 × 10^-320IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+15,839
Nearest square below15,625
Nearest square above15,876

Powers & multiples

-15,837 to the power 2250,810,569
-15,837 to the power 3-3,972,086,981,253
-15,837 to the power 462,905,941,522,103,761
-15,837 to the power 5-996,241,395,885,557,262,957
First ten multiples-15,837, -31,674, -47,511, -63,348, -79,185, -95,022, -110,859, -126,696, -142,533, -158,370
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,583,700%
-15,837% as a decimal-158.37
-15,837% of 100-15,837
-15,837% of 1,000-158,370
As a fraction of 100-15,837/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 “-15837” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.