Recognised as Number
-6,221
- Negative
- Odd
- 4 digits
-6,221 is an odd 4-digit integer and the negative of 6,221. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value6,221
Digit count4
Digit sum11
Digit product24
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 × 6,221
Distinct prime factors16,221
Number of divisors2
Sum of divisors σ(n)6,222
SquarefreeYesno repeated prime factor
All divisors1, 6,2212 in total
Arithmetic
Previous number-6,222
Next number-6,220
Double-12,442
Half-3,110.5
Square38,700,841
Cube-240,757,931,861
Cube root-18.391623471≈
Negation6,221
Reciprocal-0.0001607459≈
Representations
Decimal-6,221
Binary110000100110113 bits
Octal14115
Hexadecimal184D
Base 364ST
In wordsminus six thousand, two hundred and twenty-one
Ordinalminus six thousand, two hundred and twenty-first
Scientific notation-6.221 × 10^3
Engineering notation-6.221 × 10^3
In other bases
Ternary22112102base 3; the most digit-efficient integer base after e: 8 digits
Quinary144341base 5; one hand: 6 digits
Septenary24065base 7: 5 digits
Nonary8472base 9; each digit is two ternary digits: 4 digits
Duodecimal3725base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimalfb1base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal1:43:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT00111TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100011110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110011110110011
Bit length13 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits7within that length
Bit parityeven6 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
Bytes218 4d
Gray code1010001101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110011110110011two's complement
32-bit11111111111111111110011110110011two's complement
64-bit1111111111111111111111111111111111111111111111111110011110110011two's complement
One's complement0001100001001100at 16 bits, every bit flipped
Bits reversed1100110111100111at 16 bits
Rotated left by 11100111101100111at 16 bits, wrapping
Shifted left by 1-11000010011010= -12,442, no wrap
Shifted right by 1-110000100111= -3,110, discarding the low bit
These bits as a double3.07358238 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-6,221 to the power 238,700,841
-6,221 to the power 3-240,757,931,861
-6,221 to the power 41,497,755,094,107,281
-6,221 to the power 5-9,317,534,440,441,395,101
First ten multiples-6,221, -12,442, -18,663, -24,884, -31,105, -37,326, -43,547, -49,768, -55,989, -62,210
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-622,100%
-6,221% as a decimal-62.21
-6,221% of 100-6,221
-6,221% of 1,000-62,210
As a fraction of 100-6,221/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -6,221
Nerdulate something else
Nothing in mind? Surprise me · today’s page