Recognised as Number
-8,159
- Negative
- Odd
- 4 digits
-8,159 is an odd 4-digit integer and the negative of 8,159. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value8,159
Digit count4
Digit sum23
Digit product360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 41 × 199
Distinct prime factors241, 199
Number of divisors4
Sum of divisors σ(n)8,400
SquarefreeYesno repeated prime factor
All divisors1, 41, 199, 8,1594 in total
Arithmetic
Previous number-8,160
Next number-8,158
Double-16,318
Half-4,079.5
Square66,569,281
Cube-543,138,763,679
Cube root-20.131631753≈
Negation8,159
Reciprocal-0.000122564≈
Representations
Decimal-8,159
Binary111111101111113 bits
Octal17737
Hexadecimal1FDF
Base 366AN
In wordsminus eight thousand, one hundred and fifty-nine
Ordinalminus eight thousand, one hundred and fifty-ninth
Scientific notation-8.159 × 10^3
Engineering notation-8.159 × 10^3
In other bases
Ternary102012012base 3; the most digit-efficient integer base after e: 9 digits
Quinary230114base 5; one hand: 6 digits
Septenary32534base 7: 5 digits
Nonary12165base 9; each digit is two ternary digits: 5 digits
Duodecimal487bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal107jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal2:15:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT1T11T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110000000100001
Bit length13 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits1within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes21f df
Gray code1000000110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110000000100001two's complement
32-bit11111111111111111110000000100001two's complement
64-bit1111111111111111111111111111111111111111111111111110000000100001two's complement
One's complement0001111111011110at 16 bits, every bit flipped
Bits reversed1000010000000111at 16 bits
Rotated left by 11100000001000011at 16 bits, wrapping
Shifted left by 1-11111110111110= -16,318, no wrap
Shifted right by 1-111111110000= -4,079, discarding the low bit
These bits as a double4.0310816 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-8,159 to the power 266,569,281
-8,159 to the power 3-543,138,763,679
-8,159 to the power 44,431,469,172,856,961
-8,159 to the power 5-36,156,356,981,339,944,799
First ten multiples-8,159, -16,318, -24,477, -32,636, -40,795, -48,954, -57,113, -65,272, -73,431, -81,590
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59
As a percentage & fraction
As a percentage-815,900%
-8,159% as a decimal-81.59
-8,159% of 100-8,159
-8,159% of 1,000-81,590
As a fraction of 100-8,159/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -8,159
Nerdulate something else
Nothing in mind? Surprise me · today’s page