Recognised as Number
-3,159
- Negative
- Odd
- 4 digits
-3,159 is an odd 4-digit integer and the negative of 3,159. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,159
Digit count4
Digit sum18
Digit product135
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^5 × 13
Distinct prime factors23, 13
Number of divisors12
Sum of divisors σ(n)5,096
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 27, 39, 81, 117, 243, 351, 1,053, 3,15912 in total
Arithmetic
Representations
Decimal-3,159
Binary11000101011112 bits
Octal6127
HexadecimalC57
Base 362FR
In wordsminus three thousand, one hundred and fifty-nine
Ordinalminus three thousand, one hundred and fifty-ninth
Scientific notation-3.159 × 10^3
Engineering notation-3.159 × 10^3
In other bases
Ternary11100000base 3; the most digit-efficient integer base after e: 8 digits
Quinary100114base 5; one hand: 6 digits
Septenary12132base 7: 5 digits
Nonary4300base 9; each digit is two ternary digits: 4 digits
Duodecimal19b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal7hjbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal52:39base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryTTT00000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001110101001
Bit length12 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits5within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes20c 57
Gray code101001111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001110101001two's complement
32-bit11111111111111111111001110101001two's complement
64-bit1111111111111111111111111111111111111111111111111111001110101001two's complement
One's complement0000110001010110at 16 bits, every bit flipped
Bits reversed1001010111001111at 16 bits
Rotated left by 11110011101010011at 16 bits, wrapping
Shifted left by 1-1100010101110= -6,318, no wrap
Shifted right by 1-11000101100= -1,579, discarding the low bit
These bits as a double1.56075338 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,159 to the power 29,979,281
-3,159 to the power 3-31,524,548,679
-3,159 to the power 499,586,049,276,961
-3,159 to the power 5-314,592,329,665,919,799
First ten multiples-3,159, -6,318, -9,477, -12,636, -15,795, -18,954, -22,113, -25,272, -28,431, -31,590
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 59
As a percentage & fraction
As a percentage-315,900%
-3,159% as a decimal-31.59
-3,159% of 100-3,159
-3,159% of 1,000-31,590
As a fraction of 100-3,159/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,159
Nerdulate something else
Nothing in mind? Surprise me · today’s page