Recognised as Number
-133,391
- Negative
- Odd
- 6 digits
-133,391 is an odd 6-digit integer and the negative of 133,391. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value133,391
Digit count6
Digit sum20
Digit product243
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 × 133,391
Distinct prime factors1133,391
Number of divisors2
Sum of divisors σ(n)133,392
SquarefreeYesno repeated prime factor
All divisors1, 133,3912 in total
Arithmetic
Representations
Decimal-133,391
Binary10000010010000111118 bits
Octal404417
Hexadecimal2090F
Base 362UXB
In wordsminus one hundred and thirty-three thousand, three hundred and ninety-one
Ordinalminus one hundred and thirty-three thousand, three hundred and ninety-first
Scientific notation-1.33391 × 10^5
Engineering notation-133.391 × 10^3
In other bases
Ternary20202222102base 3; the most digit-efficient integer base after e: 11 digits
Quinary13232031base 5; one hand: 8 digits
Septenary1063616base 7: 7 digits
Nonary222872base 9; each digit is two ternary digits: 6 digits
Duodecimal6523bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgd9bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:3:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1T0001TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000101100110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111011011110001
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 set bits, so odd; 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 09 0f
Gray code110000110110001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111011011110001two's complement
64-bit1111111111111111111111111111111111111111111111011111011011110001two's complement
One's complement00000000000000100000100100001110at 32 bits, every bit flipped
Bits reversed10001111011011111011111111111111at 32 bits
Rotated left by 111111111111110111110110111100011at 32 bits, wrapping
Shifted left by 1-1000001001000011110= -266,782, no wrap
Shifted right by 1-10000010010001000= -66,695, discarding the low bit
These bits as a double6.59039106 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-133,391 to the power 217,793,158,881
-133,391 to the power 3-2,373,447,256,295,471
-133,391 to the power 4316,596,502,964,509,172,161
-133,391 to the power 5-42,231,124,126,938,842,983,727,951
First ten multiples-133,391, -266,782, -400,173, -533,564, -666,955, -800,346, -933,737, -1,067,128, -1,200,519, -1,333,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 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-13,339,100%
-133,391% as a decimal-1,333.91
-133,391% of 100-133,391
-133,391% of 1,000-1,333,910
As a fraction of 100-133,391/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -133,391
Nerdulate something else
Nothing in mind? Surprise me · today’s page