Recognised as Number
-117,171
- Negative
- Odd
- 6 digits
-117,171 is an odd 6-digit integer and the negative of 117,171. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value117,171
Digit count6
Digit sum18
Digit product49
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 47 × 277
Distinct prime factors33, 47, 277
Number of divisors12
Sum of divisors σ(n)173,472
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 47, 141, 277, 423, 831, 2,493, 13,019, 39,057, 117,17112 in total
Arithmetic
Representations
Decimal-117,171
Binary1110010011011001117 bits
Octal344663
Hexadecimal1C9B3
Base 362IER
In wordsminus one hundred and seventeen thousand, one hundred and seventy-one
Ordinalminus one hundred and seventeen thousand, one hundred and seventy-first
Scientific notation-1.17171 × 10^5
Engineering notation-117.171 × 10^3
In other bases
Ternary12221201200base 3; the most digit-efficient integer base after e: 11 digits
Quinary12222141base 5; one hand: 8 digits
Septenary665415base 7: 6 digits
Nonary187650base 9; each digit is two ternary digits: 6 digits
Duodecimal57983base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalecibbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal32:32:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT100011T1100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100100101001011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100011011001001101
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 c9 b3
Gray code10010110101101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100011011001001101two's complement
64-bit1111111111111111111111111111111111111111111111100011011001001101two's complement
One's complement00000000000000011100100110110010at 32 bits, every bit flipped
Bits reversed10110010011011000111111111111111at 32 bits
Rotated left by 111111111111111000110110010011011at 32 bits, wrapping
Shifted left by 1-111001001101100110= -234,342, no wrap
Shifted right by 1-1110010011011010= -58,585, discarding the low bit
These bits as a double5.78901658 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-117,171 to the power 213,729,043,241
-117,171 to the power 3-1,608,645,725,591,211
-117,171 to the power 4188,486,628,313,247,784,081
-117,171 to the power 5-22,085,166,726,091,556,108,554,851
First ten multiples-117,171, -234,342, -351,513, -468,684, -585,855, -703,026, -820,197, -937,368, -1,054,539, -1,171,710
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 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-11,717,100%
-117,171% as a decimal-1,171.71
-117,171% of 100-117,171
-117,171% of 1,000-1,171,710
As a fraction of 100-117,171/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -117,171
Nerdulate something else
Nothing in mind? Surprise me · today’s page