Recognised as Number
-167,221
- Negative
- Odd
- 6 digits
-167,221 is an odd 6-digit integer and the negative of 167,221. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value167,221
Digit count6
Digit sum19
Digit product168
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 167,221
Distinct prime factors1167,221
Number of divisors2
Sum of divisors σ(n)167,222
SquarefreeYesno repeated prime factor
All divisors1, 167,2212 in total
Arithmetic
Representations
Decimal-167,221
Binary10100011010011010118 bits
Octal506465
Hexadecimal28D35
Base 363L11
In wordsminus one hundred and sixty-seven thousand, two hundred and twenty-one
Ordinalminus one hundred and sixty-seven thousand, two hundred and twenty-first
Scientific notation-1.67221 × 10^5
Engineering notation-167.221 × 10^3
In other bases
Ternary22111101101base 3; the most digit-efficient integer base after e: 11 digits
Quinary20322341base 5; one hand: 8 digits
Septenary1264345base 7: 7 digits
Nonary274341base 9; each digit is two ternary digits: 6 digits
Duodecimal80931base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal10i11base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal46:27:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01TTTT0TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011011111011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111010111001011001011
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 8d 35
Gray code111100101110101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111010111001011001011two's complement
64-bit1111111111111111111111111111111111111111111111010111001011001011two's complement
One's complement00000000000000101000110100110100at 32 bits, every bit flipped
Bits reversed11010011010011101011111111111111at 32 bits
Rotated left by 111111111111110101110010110010111at 32 bits, wrapping
Shifted left by 1-1010001101001101010= -334,442, no wrap
Shifted right by 1-10100011010011011= -83,610, discarding the low bit
These bits as a double8.26181514 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-167,221 to the power 227,962,862,841
-167,221 to the power 3-4,675,977,887,134,861
-167,221 to the power 4781,921,698,264,578,591,281
-167,221 to the power 5-130,753,728,305,501,096,612,600,101
First ten multiples-167,221, -334,442, -501,663, -668,884, -836,105, -1,003,326, -1,170,547, -1,337,768, -1,504,989, -1,672,210
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
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 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-16,722,100%
-167,221% as a decimal-1,672.21
-167,221% of 100-167,221
-167,221% of 1,000-1,672,210
As a fraction of 100-167,221/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -167,221
Nerdulate something else
Nothing in mind? Surprise me · today’s page