Recognised as Number
-135,191
- Negative
- Odd
- 6 digits
-135,191 is an odd 6-digit integer and the negative of 135,191. It has 12 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value135,191
Digit count6
Digit sum20
Digit product135
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7^2 × 31 × 89
Distinct prime factors37, 31, 89
Number of divisors12
Sum of divisors σ(n)164,160
SquarefreeNohas a repeated prime factor
All divisors1, 7, 31, 49, 89, 217, 623, 1,519, 2,759, 4,361, 19,313, 135,19112 in total
Arithmetic
Representations
Decimal-135,191
Binary10000100000001011118 bits
Octal410027
Hexadecimal21017
Base 362WBB
In wordsminus one hundred and thirty-five thousand, one hundred and ninety-one
Ordinalminus one hundred and thirty-five thousand, one hundred and ninety-first
Scientific notation-1.35191 × 10^5
Engineering notation-135.191 × 10^3
In other bases
Ternary20212110002base 3; the most digit-efficient integer base after e: 11 digits
Quinary13311231base 5; one hand: 8 digits
Septenary1102100base 7: 7 digits
Nonary225402base 9; each digit is two ternary digits: 6 digits
Duodecimal6629bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalghjbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:33:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T011TT00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011000000111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110111111101001
Bit length18 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits12within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 10 17
Gray code110001100000011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110111111101001two's complement
64-bit1111111111111111111111111111111111111111111111011110111111101001two's complement
One's complement00000000000000100001000000010110at 32 bits, every bit flipped
Bits reversed10010111111101111011111111111111at 32 bits
Rotated left by 111111111111110111101111111010011at 32 bits, wrapping
Shifted left by 1-1000010000000101110= -270,382, no wrap
Shifted right by 1-10000100000001100= -67,595, discarding the low bit
These bits as a double6.67932287 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-135,191 to the power 218,276,606,481
-135,191 to the power 3-2,470,832,706,772,871
-135,191 to the power 4334,034,344,461,331,203,361
-135,191 to the power 5-45,158,437,062,071,826,713,576,951
First ten multiples-135,191, -270,382, -405,573, -540,764, -675,955, -811,146, -946,337, -1,081,528, -1,216,719, -1,351,910
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
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 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-13,519,100%
-135,191% as a decimal-1,351.91
-135,191% of 100-135,191
-135,191% of 1,000-1,351,910
As a fraction of 100-135,191/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -135,191
Nerdulate something else
Nothing in mind? Surprise me · today’s page