Recognised as Number
-32,865
- Negative
- Odd
- 5 digits
-32,865 is an odd 5-digit integer and the negative of 32,865. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value32,865
Digit count5
Digit sum24
Digit product1,440
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 × 7 × 313
Distinct prime factors43, 5, 7, 313
Number of divisors16
Sum of divisors σ(n)60,288
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 7, 15, 21, 35, 105, 313, 939, 1,565, 2,191, 4,695, 6,573, 10,955, 32,86516 in total
Arithmetic
Representations
Decimal-32,865
Binary100000000110000116 bits
Octal100141
Hexadecimal8061
Base 36PCX
In wordsminus thirty-two thousand, eight hundred and sixty-five
Ordinalminus thirty-two thousand, eight hundred and sixty-fifth
Scientific notation-3.2865 × 10^4
Engineering notation-32.865 × 10^3
In other bases
Ternary1200002020base 3; the most digit-efficient integer base after e: 10 digits
Quinary2022430base 5; one hand: 7 digits
Septenary164550base 7: 6 digits
Nonary50066base 9; each digit is two ternary digits: 5 digits
Duodecimal17029base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4235base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:7:45base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11000T1T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000000011100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110111111110011111
Bit length16 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits12within that length
Bit parityeven4 set bits, so even; 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 61
Gray code1100000001010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110111111110011111two's complement
64-bit1111111111111111111111111111111111111111111111110111111110011111two's complement
One's complement00000000000000001000000001100000at 32 bits, every bit flipped
Bits reversed11111001111111101111111111111111at 32 bits
Rotated left by 111111111111111101111111100111111at 32 bits, wrapping
Shifted left by 1-10000000011000010= -65,730, no wrap
Shifted right by 1-100000000110001= -16,432, discarding the low bit
These bits as a double1.62374675 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-32,865 to the power 21,080,108,225
-32,865 to the power 3-35,497,756,814,625
-32,865 to the power 41,166,633,777,712,650,625
-32,865 to the power 5-38,341,419,104,526,262,790,625
First ten multiples-32,865, -65,730, -98,595, -131,460, -164,325, -197,190, -230,055, -262,920, -295,785, -328,650
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
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 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
As a percentage & fraction
As a percentage-3,286,500%
-32,865% as a decimal-328.65
-32,865% of 100-32,865
-32,865% of 1,000-328,650
As a fraction of 100-32,865/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -32,865
Nerdulate something else
Nothing in mind? Surprise me · today’s page