Recognised as Number
-133,121
- Negative
- Odd
- 6 digits
-133,121 is an odd 6-digit integer and the negative of 133,121. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value133,121
Digit count6
Digit sum11
Digit product18
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 133,121
Distinct prime factors1133,121
Number of divisors2
Sum of divisors σ(n)133,122
SquarefreeYesno repeated prime factor
All divisors1, 133,1212 in total
Arithmetic
Representations
Decimal-133,121
Binary10000010000000000118 bits
Octal404001
Hexadecimal20801
Base 362UPT
In wordsminus one hundred and thirty-three thousand, one hundred and twenty-one
Ordinalminus one hundred and thirty-three thousand, one hundred and twenty-first
Scientific notation-1.33121 × 10^5
Engineering notation-133.121 × 10^3
In other bases
Ternary20202121102base 3; the most digit-efficient integer base after e — 11 digits
Quinary13224441base 5; one hand — 8 digits
Septenary1063052base 7 — 7 digits
Nonary222542base 9; each digit is two ternary digits — 6 digits
Duodecimal65055base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves — 5 digits
Vigesimalgcg1base 20; hands and feet, and the Mayan and Yoruba systems — 4 digits
Sexagesimal36:58:41base 60; Babylonian, and still how an hour and a circle are divided — 3 digits
Balanced ternaryT1T1T011TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000100000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111011111111111
Bit length18 bitsto write the magnitude
Set bits3the population count, or Hamming weight
Zero bits15within that length
Bit parityodd3 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 08 01
Gray code110000110000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111011111111111two's complement
64-bit1111111111111111111111111111111111111111111111011111011111111111two's complement
One's complement00000000000000100000100000000000at 32 bits, every bit flipped
Bits reversed11111111111011111011111111111111at 32 bits
Rotated left by 111111111111110111110111111111111at 32 bits, wrapping
Shifted left by 1-1000001000000000010= -266,242, no wrap
Shifted right by 1-10000010000000001= -66,560, discarding the low bit
These bits as a double6.57705128 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-133,121 to the power 217,721,200,641
-133,121 to the power 3-2,359,063,950,530,561
-133,121 to the power 4314,040,952,158,578,810,881
-133,121 to the power 5-41,805,445,592,302,169,883,289,601
First ten multiples-133,121, -266,242, -399,363, -532,484, -665,605, -798,726, -931,847, -1,064,968, -1,198,089, -1,331,210
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-13,312,100%
-133,121% as a decimal-1,331.21
-133,121% of 100-133,121
-133,121% of 1,000-1,331,210
As a fraction of 100-133,121/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -133,121
Nerdulate something else
Nothing in mind? Surprise me · today’s page