Recognised as Number
-132,661
- Negative
- Odd
- 6 digits
-132,661 is an odd 6-digit integer and the negative of 132,661. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value132,661
Digit count6
Digit sum19
Digit product216
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 132,661
Distinct prime factors1132,661
Number of divisors2
Sum of divisors σ(n)132,662
SquarefreeYesno repeated prime factor
All divisors1, 132,6612 in total
Arithmetic
Representations
Decimal-132,661
Binary10000001100011010118 bits
Octal403065
Hexadecimal20635
Base 362UD1
In wordsminus one hundred and thirty-two thousand, six hundred and sixty-one
Ordinalminus one hundred and thirty-two thousand, six hundred and sixty-first
Scientific notation-1.32661 × 10^5
Engineering notation-132.661 × 10^3
In other bases
Ternary20201222101base 3; the most digit-efficient integer base after e: 11 digits
Quinary13221121base 5; one hand: 8 digits
Septenary1061524base 7: 7 digits
Nonary221871base 9; each digit is two ternary digits: 6 digits
Duodecimal64931base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgbd1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:51:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1T1001T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111011011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111100111001011
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 06 35
Gray code110000010100101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111100111001011two's complement
64-bit1111111111111111111111111111111111111111111111011111100111001011two's complement
One's complement00000000000000100000011000110100at 32 bits, every bit flipped
Bits reversed11010011100111111011111111111111at 32 bits
Rotated left by 111111111111110111111001110010111at 32 bits, wrapping
Shifted left by 1-1000000110001101010= -265,322, no wrap
Shifted right by 1-10000001100011011= -66,330, discarding the low bit
These bits as a double6.55432426 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-132,661 to the power 217,598,940,921
-132,661 to the power 3-2,334,693,101,520,781
-132,661 to the power 4309,722,721,540,848,328,241
-132,661 to the power 5-41,088,125,962,330,480,072,779,301
First ten multiples-132,661, -265,322, -397,983, -530,644, -663,305, -795,966, -928,627, -1,061,288, -1,193,949, -1,326,610
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-13,266,100%
-132,661% as a decimal-1,326.61
-132,661% of 100-132,661
-132,661% of 1,000-1,326,610
As a fraction of 100-132,661/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -132,661
Nerdulate something else
Nothing in mind? Surprise me · today’s page