Recognised as Number
-101,117
- Negative
- Odd
- 6 digits
-101,117 is an odd 6-digit integer and the negative of 101,117. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value101,117
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 × 101,117
Distinct prime factors1101,117
Number of divisors2
Sum of divisors σ(n)101,118
SquarefreeYesno repeated prime factor
All divisors1, 101,1172 in total
Arithmetic
Representations
Decimal-101,117
Binary1100010101111110117 bits
Octal305375
Hexadecimal18AFD
Base 36260T
In wordsminus one hundred and one thousand, one hundred and seventeen
Ordinalminus one hundred and one thousand, one hundred and seventeenth
Scientific notation-1.01117 × 10^5
Engineering notation-101.117 × 10^3
In other bases
Ternary12010201002base 3; the most digit-efficient integer base after e: 11 digits
Quinary11213432base 5; one hand: 8 digits
Septenary600542base 7: 6 digits
Nonary163632base 9; each digit is two ternary digits: 6 digits
Duodecimal4a625base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalccfhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:5:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110TT10T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011010100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111010100000011
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 fd
Gray code10100111110000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111010100000011two's complement
64-bit1111111111111111111111111111111111111111111111100111010100000011two's complement
One's complement00000000000000011000101011111100at 32 bits, every bit flipped
Bits reversed11000000101011100111111111111111at 32 bits
Rotated left by 111111111111111001110101000000111at 32 bits, wrapping
Shifted left by 1-110001010111111010= -202,234, no wrap
Shifted right by 1-1100010101111111= -50,558, discarding the low bit
These bits as a double4.99584359 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-101,117 to the power 210,224,647,689
-101,117 to the power 3-1,033,885,700,368,613
-101,117 to the power 4104,543,420,364,173,040,721
-101,117 to the power 5-10,571,117,036,964,085,358,585,357
First ten multiples-101,117, -202,234, -303,351, -404,468, -505,585, -606,702, -707,819, -808,936, -910,053, -1,011,170
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 17
As a percentage & fraction
As a percentage-10,111,700%
-101,117% as a decimal-1,011.17
-101,117% of 100-101,117
-101,117% of 1,000-1,011,170
As a fraction of 100-101,117/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -101,117
Nerdulate something else
Nothing in mind? Surprise me · today’s page