Recognised as Number
-133,505
- Negative
- Odd
- 6 digits
-133,505 is an odd 6-digit integer and the negative of 133,505. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value133,505
Digit count6
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 26,701
Distinct prime factors25, 26,701
Number of divisors4
Sum of divisors σ(n)160,212
SquarefreeYesno repeated prime factor
All divisors1, 5, 26,701, 133,5054 in total
Arithmetic
Representations
Decimal-133,505
Binary10000010011000000118 bits
Octal404601
Hexadecimal20981
Base 362V0H
In wordsminus one hundred and thirty-three thousand, five hundred and five
Ordinalminus one hundred and thirty-three thousand, five hundred and fifth
Scientific notation-1.33505 × 10^5
Engineering notation-133.505 × 10^3
In other bases
Ternary20210010122base 3; the most digit-efficient integer base after e: 11 digits
Quinary13233010base 5; one hand: 8 digits
Septenary1064141base 7: 7 digits
Nonary223118base 9; each digit is two ternary digits: 6 digits
Duodecimal65315base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgdf5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:5:5base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1T00TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000101110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111011001111111
Bit length18 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits13within that length
Bit parityodd5 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 81
Gray code110000110101000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111011001111111two's complement
64-bit1111111111111111111111111111111111111111111111011111011001111111two's complement
One's complement00000000000000100000100110000000at 32 bits, every bit flipped
Bits reversed11111110011011111011111111111111at 32 bits
Rotated left by 111111111111110111110110011111111at 32 bits, wrapping
Shifted left by 1-1000001001100000010= -267,010, no wrap
Shifted right by 1-10000010011000001= -66,752, discarding the low bit
These bits as a double6.5960234 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-133,505 to the power 217,823,585,025
-133,505 to the power 3-2,379,537,718,762,625
-133,505 to the power 4317,680,183,143,404,250,625
-133,505 to the power 5-42,411,892,850,560,184,479,690,625
First ten multiples-133,505, -267,010, -400,515, -534,020, -667,525, -801,030, -934,535, -1,068,040, -1,201,545, -1,335,050
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 5
As a percentage & fraction
As a percentage-13,350,500%
-133,505% as a decimal-1,335.05
-133,505% of 100-133,505
-133,505% of 1,000-1,335,050
As a fraction of 100-133,505/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -133,505
Nerdulate something else
Nothing in mind? Surprise me · today’s page