Recognised as Number
-167,197
- Negative
- Odd
- 6 digits
-167,197 is an odd 6-digit integer and the negative of 167,197. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value167,197
Digit count6
Digit sum31
Digit product2,646
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 167,197
Distinct prime factors1167,197
Number of divisors2
Sum of divisors σ(n)167,198
SquarefreeYesno repeated prime factor
All divisors1, 167,1972 in total
Arithmetic
Representations
Decimal-167,197
Binary10100011010001110118 bits
Octal506435
Hexadecimal28D1D
Base 363L0D
In wordsminus one hundred and sixty-seven thousand, one hundred and ninety-seven
Ordinalminus one hundred and sixty-seven thousand, one hundred and ninety-seventh
Scientific notation-1.67197 × 10^5
Engineering notation-167.197 × 10^3
In other bases
Ternary22111100111base 3; the most digit-efficient integer base after e: 11 digits
Quinary20322242base 5; one hand: 8 digits
Septenary1264312base 7: 7 digits
Nonary274314base 9; each digit is two ternary digits: 6 digits
Duodecimal80911base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal10hjhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal46:26:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01TTTT00TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011011100100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111010111001011100011
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 1d
Gray code111100101110010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111010111001011100011two's complement
64-bit1111111111111111111111111111111111111111111111010111001011100011two's complement
One's complement00000000000000101000110100011100at 32 bits, every bit flipped
Bits reversed11000111010011101011111111111111at 32 bits
Rotated left by 111111111111110101110010111000111at 32 bits, wrapping
Shifted left by 1-1010001101000111010= -334,394, no wrap
Shifted right by 1-10100011010001111= -83,598, discarding the low bit
These bits as a double8.26062938 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-167,197 to the power 227,954,836,809
-167,197 to the power 3-4,673,964,849,954,373
-167,197 to the power 4781,472,901,017,821,302,481
-167,197 to the power 5-130,659,924,631,476,668,310,915,757
First ten multiples-167,197, -334,394, -501,591, -668,788, -835,985, -1,003,182, -1,170,379, -1,337,576, -1,504,773, -1,671,970
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 1
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-16,719,700%
-167,197% as a decimal-1,671.97
-167,197% of 100-167,197
-167,197% of 1,000-1,671,970
As a fraction of 100-167,197/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -167,197
Nerdulate something else
Nothing in mind? Surprise me · today’s page