Recognised as Number
-3,321
- Negative
- Odd
- 4 digits
-3,321 is an odd 4-digit integer and the negative of 3,321. It has 10 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,321
Digit count4
Digit sum9
Digit product18
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^4 × 41
Distinct prime factors23, 41
Number of divisors10
Sum of divisors σ(n)5,082
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 41, 81, 123, 369, 1,107, 3,32110 in total
Arithmetic
Previous number-3,322
Next number-3,320
Double-6,642
Half-1,660.5
Square11,029,041
Cube-36,627,445,161
Cube root-14.9195695≈
Negation3,321
Reciprocal-0.0003011141≈
Representations
Decimal-3,321
Binary11001111100112 bits
Octal6371
HexadecimalCF9
Base 362K9
In wordsminus three thousand, three hundred and twenty-one
Ordinalminus three thousand, three hundred and twenty-first
Scientific notation-3.321 × 10^3
Engineering notation-3.321 × 10^3
In other bases
Ternary11120000base 3; the most digit-efficient integer base after e: 8 digits
Quinary101241base 5; one hand: 6 digits
Septenary12453base 7: 5 digits
Nonary4500base 9; each digit is two ternary digits: 4 digits
Duodecimal1b09base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal861base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal55:21base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT11110000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111001100000111
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
Bytes20c f9
Gray code101010000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111001100000111two's complement
32-bit11111111111111111111001100000111two's complement
64-bit1111111111111111111111111111111111111111111111111111001100000111two's complement
One's complement0000110011111000at 16 bits, every bit flipped
Bits reversed1110000011001111at 16 bits
Rotated left by 11110011000001111at 16 bits, wrapping
Shifted left by 1-1100111110010= -6,642, no wrap
Shifted right by 1-11001111101= -1,660, discarding the low bit
These bits as a double1.64079201 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-3,321 to the power 211,029,041
-3,321 to the power 3-36,627,445,161
-3,321 to the power 4121,639,745,379,681
-3,321 to the power 5-403,965,594,405,920,601
First ten multiples-3,321, -6,642, -9,963, -13,284, -16,605, -19,926, -23,247, -26,568, -29,889, -33,210
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-332,100%
-3,321% as a decimal-33.21
-3,321% of 100-3,321
-3,321% of 1,000-33,210
As a fraction of 100-3,321/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -3,321
Nerdulate something else
Nothing in mind? Surprise me · today’s page