Recognised as Number
-101,121
- Negative
- Odd
- 6 digits
-101,121 is an odd 6-digit integer and the negative of 101,121. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value101,121
Digit count6
Digit sum6
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 × 37 × 911
Distinct prime factors33, 37, 911
Number of divisors8
Sum of divisors σ(n)138,624
SquarefreeYesno repeated prime factor
All divisors1, 3, 37, 111, 911, 2,733, 33,707, 101,1218 in total
Arithmetic
Representations
Decimal-101,121
Binary1100010110000000117 bits
Octal305401
Hexadecimal18B01
Base 36260X
In wordsminus one hundred and one thousand, one hundred and twenty-one
Ordinalminus one hundred and one thousand, one hundred and twenty-first
Scientific notation-1.01121 × 10^5
Engineering notation-101.121 × 10^3
In other bases
Ternary12010201020base 3; the most digit-efficient integer base after e: 11 digits
Quinary11213441base 5; one hand: 8 digits
Septenary600546base 7: 6 digits
Nonary163636base 9; each digit is two ternary digits: 6 digits
Duodecimal4a629base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalccg1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:5:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110TT10TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011010100000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111010011111111
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 set bits, so even; 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 01
Gray code10100111010000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111010011111111two's complement
64-bit1111111111111111111111111111111111111111111111100111010011111111two's complement
One's complement00000000000000011000101100000000at 32 bits, every bit flipped
Bits reversed11111111001011100111111111111111at 32 bits
Rotated left by 111111111111111001110100111111111at 32 bits, wrapping
Shifted left by 1-110001011000000010= -202,242, no wrap
Shifted right by 1-1100010110000001= -50,560, discarding the low bit
These bits as a double4.99604122 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-101,121 to the power 210,225,456,641
-101,121 to the power 3-1,034,008,400,994,561
-101,121 to the power 4104,559,963,516,971,002,881
-101,121 to the power 5-10,573,208,070,799,624,782,329,601
First ten multiples-101,121, -202,242, -303,363, -404,484, -505,605, -606,726, -707,847, -808,968, -910,089, -1,011,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 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-10,112,100%
-101,121% as a decimal-1,011.21
-101,121% of 100-101,121
-101,121% of 1,000-1,011,210
As a fraction of 100-101,121/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -101,121
Nerdulate something else
Nothing in mind? Surprise me · today’s page