Recognised as Number
-101,115
- Negative
- Odd
- 6 digits
-101,115 is an odd 6-digit integer and the negative of 101,115. It has 32 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value101,115
Digit count6
Digit sum9
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^3 × 5 × 7 × 107
Distinct prime factors43, 5, 7, 107
Number of divisors32
Sum of divisors σ(n)207,360
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 7, 9, 15, 21, 27, 35, 45, 63, 105, 107, 135, 189, 315, 321, 535, 749, 945, 963, 1,605, 2,247, 2,889, 3,745, 4,815, 6,741, 11,235, 14,445, 20,223, 33,705, 101,11532 in total
Arithmetic
Representations
Decimal-101,115
Binary1100010101111101117 bits
Octal305373
Hexadecimal18AFB
Base 36260R
In wordsminus one hundred and one thousand, one hundred and fifteen
Ordinalminus one hundred and one thousand, one hundred and fifteenth
Scientific notation-1.01115 × 10^5
Engineering notation-101.115 × 10^3
In other bases
Ternary12010201000base 3; the most digit-efficient integer base after e: 11 digits
Quinary11213430base 5; one hand: 8 digits
Septenary600540base 7: 6 digits
Nonary163630base 9; each digit is two ternary digits: 6 digits
Duodecimal4a623base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalccffbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:5:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110TT10T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011010100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111010100000101
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 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 8a fb
Gray code10100111110000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111010100000101two's complement
64-bit1111111111111111111111111111111111111111111111100111010100000101two's complement
One's complement00000000000000011000101011111010at 32 bits, every bit flipped
Bits reversed10100000101011100111111111111111at 32 bits
Rotated left by 111111111111111001110101000001011at 32 bits, wrapping
Shifted left by 1-110001010111110110= -202,230, no wrap
Shifted right by 1-1100010101111110= -50,557, discarding the low bit
These bits as a double4.99574478 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-101,115 to the power 210,224,243,225
-101,115 to the power 3-1,033,824,353,695,875
-101,115 to the power 4104,535,149,523,958,400,625
-101,115 to the power 5-10,570,071,644,115,053,679,196,875
First ten multiples-101,115, -202,230, -303,345, -404,460, -505,575, -606,690, -707,805, -808,920, -910,035, -1,011,150
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 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 15
As a percentage & fraction
As a percentage-10,111,500%
-101,115% as a decimal-1,011.15
-101,115% of 100-101,115
-101,115% of 1,000-1,011,150
As a fraction of 100-101,115/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -101,115
Nerdulate something else
Nothing in mind? Surprise me · today’s page