Recognised as Number
-132,439
- Negative
- Odd
- 6 digits
-132,439 is an odd 6-digit integer and the negative of 132,439. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value132,439
Digit count6
Digit sum22
Digit product648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 132,439
Distinct prime factors1132,439
Number of divisors2
Sum of divisors σ(n)132,440
SquarefreeYesno repeated prime factor
All divisors1, 132,4392 in total
Arithmetic
Representations
Decimal-132,439
Binary10000001010101011118 bits
Octal402527
Hexadecimal20557
Base 362U6V
In wordsminus one hundred and thirty-two thousand, four hundred and thirty-nine
Ordinalminus one hundred and thirty-two thousand, four hundred and thirty-ninth
Scientific notation-1.32439 × 10^5
Engineering notation-132.439 × 10^3
In other bases
Ternary20201200011base 3; the most digit-efficient integer base after e: 11 digits
Quinary13214224base 5; one hand: 8 digits
Septenary1061056base 7: 7 digits
Nonary221604base 9; each digit is two ternary digits: 6 digits
Duodecimal64787base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgb1jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:47:19base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1T11000TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111111111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111101010101001
Bit length18 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits10within that length
Bit parityeven8 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 05 57
Gray code110000011111111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111101010101001two's complement
64-bit1111111111111111111111111111111111111111111111011111101010101001two's complement
One's complement00000000000000100000010101010110at 32 bits, every bit flipped
Bits reversed10010101010111111011111111111111at 32 bits
Rotated left by 111111111111110111111010101010011at 32 bits, wrapping
Shifted left by 1-1000000101010101110= -264,878, no wrap
Shifted right by 1-10000001010101100= -66,219, discarding the low bit
These bits as a double6.54335601 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-132,439 to the power 217,540,088,721
-132,439 to the power 3-2,322,991,810,120,519
-132,439 to the power 4307,654,712,340,551,415,841
-132,439 to the power 5-40,745,482,447,670,288,962,566,199
First ten multiples-132,439, -264,878, -397,317, -529,756, -662,195, -794,634, -927,073, -1,059,512, -1,191,951, -1,324,390
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39
As a percentage & fraction
As a percentage-13,243,900%
-132,439% as a decimal-1,324.39
-132,439% of 100-132,439
-132,439% of 1,000-1,324,390
As a fraction of 100-132,439/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -132,439
Nerdulate something else
Nothing in mind? Surprise me · today’s page