Recognised as Number
-3,359
- Negative
- Odd
- 4 digits
-3,359 is an odd 4-digit integer and the negative of 3,359. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,359
Digit count4
Digit sum20
Digit product405
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3,359
Distinct prime factors13,359
Number of divisors2
Sum of divisors σ(n)3,360
SquarefreeYesno repeated prime factor
All divisors1, 3,3592 in total
Arithmetic
Previous number-3,360
Next number-3,358
Double-6,718
Half-1,679.5
Square11,282,881
Cube-37,899,197,279
Cube root-14.97625874≈
Negation3,359
Reciprocal-0.0002977077≈
Representations
Decimal-3,359
Binary11010001111112 bits
Octal6437
HexadecimalD1F
Base 362LB
In wordsminus three thousand, three hundred and fifty-nine
Ordinalminus three thousand, three hundred and fifty-ninth
Scientific notation-3.359 × 10^3
Engineering notation-3.359 × 10^3
In other bases
Ternary11121102base 3; the most digit-efficient integer base after e: 8 digits
Quinary101414base 5; one hand: 6 digits
Septenary12536base 7: 5 digits
Nonary4542base 9; each digit is two ternary digits: 4 digits
Duodecimal1b3bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal87jbase 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal55:59base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT1111TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001011100001
Bit length12 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits4within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 11worth 2,048
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes20d 1f
Gray code101110010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001011100001two's complement
32-bit11111111111111111111001011100001two's complement
64-bit1111111111111111111111111111111111111111111111111111001011100001two's complement
One's complement0000110100011110at 16 bits, every bit flipped
Bits reversed1000011101001111at 16 bits
Rotated left by 11110010111000011at 16 bits, wrapping
Shifted left by 1-1101000111110= -6,718, no wrap
Shifted right by 1-11010010000= -1,679, discarding the low bit
These bits as a double1.6595665 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,359 to the power 211,282,881
-3,359 to the power 3-37,899,197,279
-3,359 to the power 4127,303,403,660,161
-3,359 to the power 5-427,612,132,894,480,799
First ten multiples-3,359, -6,718, -10,077, -13,436, -16,795, -20,154, -23,513, -26,872, -30,231, -33,590
Powers of twoBetween 2^11 (2,048) and 2^12 (4,096)
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 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59
As a percentage & fraction
As a percentage-335,900%
-3,359% as a decimal-33.59
-3,359% of 100-3,359
-3,359% of 1,000-33,590
As a fraction of 100-3,359/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,359
Nerdulate something else
Nothing in mind? Surprise me · today’s page