Recognised as Number
-22,141
- Negative
- Odd
- 5 digits
-22,141 is an odd 5-digit integer and the negative of 22,141. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value22,141
Digit count5
Digit sum10
Digit product16
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 × 7 × 3,163
Distinct prime factors27, 3,163
Number of divisors4
Sum of divisors σ(n)25,312
SquarefreeYesno repeated prime factor
All divisors1, 7, 3,163, 22,1414 in total
Arithmetic
Representations
Decimal-22,141
Binary10101100111110115 bits
Octal53175
Hexadecimal567D
Base 36H31
In wordsminus twenty-two thousand, one hundred and forty-one
Ordinalminus twenty-two thousand, one hundred and forty-first
Scientific notation-2.2141 × 10^4
Engineering notation-22.141 × 10^3
In other bases
Ternary1010101001base 3; the most digit-efficient integer base after e: 10 digits
Quinary1202031base 5; one hand: 7 digits
Septenary121360base 7: 6 digits
Nonary33331base 9; each digit is two ternary digits: 5 digits
Duodecimal10991base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal2f71base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:9:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T0T0T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111111010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010100110000011
Bit length15 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits5within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes256 7d
Gray code111110101000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010100110000011two's complement
32-bit11111111111111111010100110000011two's complement
64-bit1111111111111111111111111111111111111111111111111010100110000011two's complement
One's complement0101011001111100at 16 bits, every bit flipped
Bits reversed1100000110010101at 16 bits
Rotated left by 10101001100000111at 16 bits, wrapping
Shifted left by 1-1010110011111010= -44,282, no wrap
Shifted right by 1-10101100111111= -11,070, discarding the low bit
These bits as a double1.09391075 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-22,141 to the power 2490,223,881
-22,141 to the power 3-10,854,046,949,221
-22,141 to the power 4240,319,453,502,702,161
-22,141 to the power 5-5,320,913,020,003,328,546,701
First ten multiples-22,141, -44,282, -66,423, -88,564, -110,705, -132,846, -154,987, -177,128, -199,269, -221,410
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 41
As a percentage & fraction
As a percentage-2,214,100%
-22,141% as a decimal-221.41
-22,141% of 100-22,141
-22,141% of 1,000-221,410
As a fraction of 100-22,141/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -22,141
Nerdulate something else
Nothing in mind? Surprise me · today’s page