Recognised as Number
-133,125
- Negative
- Odd
- 6 digits
-133,125 is an odd 6-digit integer and the negative of 133,125. It has 20 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value133,125
Digit count6
Digit sum15
Digit product90
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5^4 × 71
Distinct prime factors33, 5, 71
Number of divisors20
Sum of divisors σ(n)224,928
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 15, 25, 71, 75, 125, 213, 355, 375, 625, 1,065, 1,775, 1,875, 5,325, 8,875, 26,625, 44,375, 133,12520 in total
Arithmetic
Representations
Decimal-133,125
Binary10000010000000010118 bits
Octal404005
Hexadecimal20805
Base 362UPX
In wordsminus one hundred and thirty-three thousand, one hundred and twenty-five
Ordinalminus one hundred and thirty-three thousand, one hundred and twenty-fifth
Scientific notation-1.33125 × 10^5
Engineering notation-133.125 × 10^3
In other bases
Ternary20202121120base 3; the most digit-efficient integer base after e: 11 digits
Quinary13230000base 5; one hand: 8 digits
Septenary1063056base 7: 7 digits
Nonary222546base 9; each digit is two ternary digits: 6 digits
Duodecimal65059base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgcg5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:58:45base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1T0101110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000100000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111011111111011
Bit length18 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits14within that length
Bit parityeven4 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 08 05
Gray code110000110000000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111011111111011two's complement
64-bit1111111111111111111111111111111111111111111111011111011111111011two's complement
One's complement00000000000000100000100000000100at 32 bits, every bit flipped
Bits reversed11011111111011111011111111111111at 32 bits
Rotated left by 111111111111110111110111111110111at 32 bits, wrapping
Shifted left by 1-1000001000000001010= -266,250, no wrap
Shifted right by 1-10000010000000011= -66,562, discarding the low bit
These bits as a double6.57724891 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-133,125 to the power 217,722,265,625
-133,125 to the power 3-2,359,276,611,328,125
-133,125 to the power 4314,078,698,883,056,640,625
-133,125 to the power 5-41,811,726,788,806,915,283,203,125
First ten multiples-133,125, -266,250, -399,375, -532,500, -665,625, -798,750, -931,875, -1,065,000, -1,198,125, -1,331,250
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 25
As a percentage & fraction
As a percentage-13,312,500%
-133,125% as a decimal-1,331.25
-133,125% of 100-133,125
-133,125% of 1,000-1,331,250
As a fraction of 100-133,125/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -133,125
Nerdulate something else
Nothing in mind? Surprise me · today’s page