Recognised as Number
-32,761
- Negative
- Odd
- Perfect square
- 5 digits
-32,761 is an odd 5-digit integer and the negative of 32,761. It has 3 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value32,761
Digit count5
Digit sum19
Digit product252
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 181²
Factors & divisors
Prime factorisation−1 × 181^2
Distinct prime factors1181
Number of divisors3
Sum of divisors σ(n)32,943
SquarefreeNohas a repeated prime factor
All divisors1, 181, 32,7613 in total
Arithmetic
Representations
Decimal-32,761
Binary11111111111100115 bits
Octal77771
Hexadecimal7FF9
Base 36PA1
In wordsminus thirty-two thousand, seven hundred and sixty-one
Ordinalminus thirty-two thousand, seven hundred and sixty-first
Scientific notation-3.2761 × 10^4
Engineering notation-32.761 × 10^3
In other bases
Ternary1122221101base 3; the most digit-efficient integer base after e: 10 digits
Quinary2022021base 5; one hand: 7 digits
Septenary164341base 7: 6 digits
Nonary48841base 9; each digit is two ternary digits: 5 digits
Duodecimal16b61base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal41i1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:6:1base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110001TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000000000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000000000000111
Bit length15 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits2within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes27f f9
Gray code100000000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000000000000111two's complement
32-bit11111111111111111000000000000111two's complement
64-bit1111111111111111111111111111111111111111111111111000000000000111two's complement
One's complement0111111111111000at 16 bits, every bit flipped
Bits reversed1110000000000001at 16 bits
Rotated left by 10000000000001111at 16 bits, wrapping
Shifted left by 1-1111111111110010= -65,522, no wrap
Shifted right by 1-11111111111101= -16,380, discarding the low bit
These bits as a double1.61860846 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-32,761 to the power 21,073,283,121
-32,761 to the power 3-35,161,828,327,081
-32,761 to the power 41,151,936,657,823,500,641
-32,761 to the power 5-37,738,596,846,955,704,499,801
First ten multiples-32,761, -65,522, -98,283, -131,044, -163,805, -196,566, -229,327, -262,088, -294,849, -327,610
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-3,276,100%
-32,761% as a decimal-327.61
-32,761% of 100-32,761
-32,761% of 1,000-327,610
As a fraction of 100-32,761/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -32,761
Nerdulate something else
Nothing in mind? Surprise me · today’s page