Recognised as Number
-32,869
- Negative
- Odd
- 5 digits
-32,869 is an odd 5-digit integer and the negative of 32,869. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value32,869
Digit count5
Digit sum28
Digit product2,592
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 × 32,869
Distinct prime factors132,869
Number of divisors2
Sum of divisors σ(n)32,870
SquarefreeYesno repeated prime factor
All divisors1, 32,8692 in total
Arithmetic
Representations
Decimal-32,869
Binary100000000110010116 bits
Octal100145
Hexadecimal8065
Base 36PD1
In wordsminus thirty-two thousand, eight hundred and sixty-nine
Ordinalminus thirty-two thousand, eight hundred and sixty-ninth
Scientific notation-3.2869 × 10^4
Engineering notation-32.869 × 10^3
In other bases
Ternary1200002101base 3; the most digit-efficient integer base after e: 10 digits
Quinary2022434base 5; one hand: 7 digits
Septenary164554base 7: 6 digits
Nonary50071base 9; each digit is two ternary digits: 5 digits
Duodecimal17031base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4239base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:7:49base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11000T1T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000000011101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110111111110011011
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes280 65
Gray code1100000001010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110111111110011011two's complement
64-bit1111111111111111111111111111111111111111111111110111111110011011two's complement
One's complement00000000000000001000000001100100at 32 bits, every bit flipped
Bits reversed11011001111111101111111111111111at 32 bits
Rotated left by 111111111111111101111111100110111at 32 bits, wrapping
Shifted left by 1-10000000011001010= -65,738, no wrap
Shifted right by 1-100000000110011= -16,434, discarding the low bit
These bits as a double1.62394437 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-32,869 to the power 21,080,371,161
-32,869 to the power 3-35,510,719,690,909
-32,869 to the power 41,167,201,845,520,487,921
-32,869 to the power 5-38,364,757,460,412,917,475,349
First ten multiples-32,869, -65,738, -98,607, -131,476, -164,345, -197,214, -230,083, -262,952, -295,821, -328,690
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69
As a percentage & fraction
As a percentage-3,286,900%
-32,869% as a decimal-328.69
-32,869% of 100-32,869
-32,869% of 1,000-328,690
As a fraction of 100-32,869/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -32,869
Nerdulate something else
Nothing in mind? Surprise me · today’s page