Recognised as Number
-101,171
- Negative
- Odd
- 6 digits
-101,171 is an odd 6-digit integer and the negative of 101,171. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value101,171
Digit count6
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 97 × 149
Distinct prime factors37, 97, 149
Number of divisors8
Sum of divisors σ(n)117,600
SquarefreeYesno repeated prime factor
All divisors1, 7, 97, 149, 679, 1,043, 14,453, 101,1718 in total
Arithmetic
Representations
Decimal-101,171
Binary1100010110011001117 bits
Octal305463
Hexadecimal18B33
Base 36262B
In wordsminus one hundred and one thousand, one hundred and seventy-one
Ordinalminus one hundred and one thousand, one hundred and seventy-first
Scientific notation-1.01171 × 10^5
Engineering notation-101.171 × 10^3
In other bases
Ternary12010210002base 3; the most digit-efficient integer base after e: 11 digits
Quinary11214141base 5; one hand: 8 digits
Septenary600650base 7: 6 digits
Nonary163702base 9; each digit is two ternary digits: 6 digits
Duodecimal4a66bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalccibbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:6:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110TT1T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011010111011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111010011001101
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 33
Gray code10100111010101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111010011001101two's complement
64-bit1111111111111111111111111111111111111111111111100111010011001101two's complement
One's complement00000000000000011000101100110010at 32 bits, every bit flipped
Bits reversed10110011001011100111111111111111at 32 bits
Rotated left by 111111111111111001110100110011011at 32 bits, wrapping
Shifted left by 1-110001011001100110= -202,342, no wrap
Shifted right by 1-1100010110011010= -50,585, discarding the low bit
These bits as a double4.99851155 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-101,171 to the power 210,235,571,241
-101,171 to the power 3-1,035,542,978,023,211
-101,171 to the power 4104,766,918,629,586,280,081
-101,171 to the power 5-10,599,373,924,673,873,542,074,851
First ten multiples-101,171, -202,342, -303,513, -404,684, -505,855, -607,026, -708,197, -809,368, -910,539, -1,011,710
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-10,117,100%
-101,171% as a decimal-1,011.71
-101,171% of 100-101,171
-101,171% of 1,000-1,011,710
As a fraction of 100-101,171/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -101,171
Nerdulate something else
Nothing in mind? Surprise me · today’s page