Recognised as Number
-4,159
- Negative
- Odd
- 4 digits
-4,159 is an odd 4-digit integer and the negative of 4,159. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value4,159
Digit count4
Digit sum19
Digit product180
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 4,159
Distinct prime factors14,159
Number of divisors2
Sum of divisors σ(n)4,160
SquarefreeYesno repeated prime factor
All divisors1, 4,1592 in total
Arithmetic
Previous number-4,160
Next number-4,158
Double-8,318
Half-2,079.5
Square17,297,281
Cube-71,939,391,679
Cube root-16.081614237≈
Negation4,159
Reciprocal-0.0002404424≈
Representations
Decimal-4,159
Binary100000011111113 bits
Octal10077
Hexadecimal103F
Base 3637J
In wordsminus four thousand, one hundred and fifty-nine
Ordinalminus four thousand, one hundred and fifty-ninth
Scientific notation-4.159 × 10^3
Engineering notation-4.159 × 10^3
In other bases
Ternary12201001base 3; the most digit-efficient integer base after e: 8 digits
Quinary113114base 5; one hand: 6 digits
Septenary15061base 7: 5 digits
Nonary5631base 9; each digit is two ternary digits: 4 digits
Duodecimal24a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimala7jbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:9:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1010T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110111111000001
Bit length13 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits6within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 12worth 4,096
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes210 3f
Gray code1100000100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110111111000001two's complement
32-bit11111111111111111110111111000001two's complement
64-bit1111111111111111111111111111111111111111111111111110111111000001two's complement
One's complement0001000000111110at 16 bits, every bit flipped
Bits reversed1000001111110111at 16 bits
Rotated left by 11101111110000011at 16 bits, wrapping
Shifted left by 1-10000001111110= -8,318, no wrap
Shifted right by 1-100000100000= -2,079, discarding the low bit
These bits as a double2.05481902 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-4,159 to the power 217,297,281
-4,159 to the power 3-71,939,391,679
-4,159 to the power 4299,195,929,992,961
-4,159 to the power 5-1,244,355,872,840,724,799
First ten multiples-4,159, -8,318, -12,477, -16,636, -20,795, -24,954, -29,113, -33,272, -37,431, -41,590
Powers of twoBetween 2^12 (4,096) and 2^13 (8,192)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 59
As a percentage & fraction
As a percentage-415,900%
-4,159% as a decimal-41.59
-4,159% of 100-4,159
-4,159% of 1,000-41,590
As a fraction of 100-4,159/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -4,159
Nerdulate something else
Nothing in mind? Surprise me · today’s page