Recognised as Number
-101,197
- Negative
- Odd
- 6 digits
-101,197 is an odd 6-digit integer and the negative of 101,197. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value101,197
Digit count6
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 101,197
Distinct prime factors1101,197
Number of divisors2
Sum of divisors σ(n)101,198
SquarefreeYesno repeated prime factor
All divisors1, 101,1972 in total
Arithmetic
Representations
Decimal-101,197
Binary1100010110100110117 bits
Octal305515
Hexadecimal18B4D
Base 362631
In wordsminus one hundred and one thousand, one hundred and ninety-seven
Ordinalminus one hundred and one thousand, one hundred and ninety-seventh
Scientific notation-1.01197 × 10^5
Engineering notation-101.197 × 10^3
In other bases
Ternary12010211001base 3; the most digit-efficient integer base after e: 11 digits
Quinary11214242base 5; one hand: 8 digits
Septenary601015base 7: 6 digits
Nonary163731base 9; each digit is two ternary digits: 6 digits
Duodecimal4a691base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalccjhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:6:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110TT1TT00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011010111110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111010010110011
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 8b 4d
Gray code10100111011101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111010010110011two's complement
64-bit1111111111111111111111111111111111111111111111100111010010110011two's complement
One's complement00000000000000011000101101001100at 32 bits, every bit flipped
Bits reversed11001101001011100111111111111111at 32 bits
Rotated left by 111111111111111001110100101100111at 32 bits, wrapping
Shifted left by 1-110001011010011010= -202,394, no wrap
Shifted right by 1-1100010110100111= -50,598, discarding the low bit
These bits as a double4.99979612 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-101,197 to the power 210,240,832,809
-101,197 to the power 3-1,036,341,557,772,373
-101,197 to the power 4104,874,656,621,890,830,481
-101,197 to the power 5-10,613,000,626,165,486,372,185,757
First ten multiples-101,197, -202,394, -303,591, -404,788, -505,985, -607,182, -708,379, -809,576, -910,773, -1,011,970
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
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 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
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-10,119,700%
-101,197% as a decimal-1,011.97
-101,197% of 100-101,197
-101,197% of 1,000-1,011,970
As a fraction of 100-101,197/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -101,197
Nerdulate something else
Nothing in mind? Surprise me · today’s page