Recognised as Number
-109,221
- Negative
- Odd
- 6 digits
-109,221 is an odd 6-digit integer and the negative of 109,221. It has 12 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value109,221
Digit count6
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7^2 × 743
Distinct prime factors33, 7, 743
Number of divisors12
Sum of divisors σ(n)169,632
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 21, 49, 147, 743, 2,229, 5,201, 15,603, 36,407, 109,22112 in total
Arithmetic
Representations
Decimal-109,221
Binary1101010101010010117 bits
Octal325245
Hexadecimal1AAA5
Base 362C9X
In wordsminus one hundred and nine thousand, two hundred and twenty-one
Ordinalminus one hundred and nine thousand, two hundred and twenty-first
Scientific notation-1.09221 × 10^5
Engineering notation-109.221 × 10^3
In other bases
Ternary12112211020base 3; the most digit-efficient integer base after e: 11 digits
Quinary11443341base 5; one hand: 8 digits
Septenary633300base 7: 6 digits
Nonary175736base 9; each digit is two ternary digits: 6 digits
Duodecimal53259base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldd11base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:20:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT101101TTT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010101010101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101010101011011
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 aa a5
Gray code10111111111110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101010101011011two's complement
64-bit1111111111111111111111111111111111111111111111100101010101011011two's complement
One's complement00000000000000011010101010100100at 32 bits, every bit flipped
Bits reversed11011010101010100111111111111111at 32 bits
Rotated left by 111111111111111001010101010110111at 32 bits, wrapping
Shifted left by 1-110101010101001010= -218,442, no wrap
Shifted right by 1-1101010101010011= -54,610, discarding the low bit
These bits as a double5.39623439 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-109,221 to the power 211,929,226,841
-109,221 to the power 3-1,302,922,084,800,861
-109,221 to the power 4142,306,453,024,034,839,281
-109,221 to the power 5-15,542,853,105,738,109,181,110,101
First ten multiples-109,221, -218,442, -327,663, -436,884, -546,105, -655,326, -764,547, -873,768, -982,989, -1,092,210
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
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 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-10,922,100%
-109,221% as a decimal-1,092.21
-109,221% of 100-109,221
-109,221% of 1,000-1,092,210
As a fraction of 100-109,221/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -109,221
Nerdulate something else
Nothing in mind? Surprise me · today’s page