Recognised as Number
-32,683
- Negative
- Odd
- 5 digits
-32,683 is an odd 5-digit integer and the negative of 32,683. It has 12 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value32,683
Digit count5
Digit sum22
Digit product864
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 × 7^2 × 23 × 29
Distinct prime factors37, 23, 29
Number of divisors12
Sum of divisors σ(n)41,040
SquarefreeNohas a repeated prime factor
All divisors1, 7, 23, 29, 49, 161, 203, 667, 1,127, 1,421, 4,669, 32,68312 in total
Arithmetic
Representations
Decimal-32,683
Binary11111111010101115 bits
Octal77653
Hexadecimal7FAB
Base 36P7V
In wordsminus thirty-two thousand, six hundred and eighty-three
Ordinalminus thirty-two thousand, six hundred and eighty-third
Scientific notation-3.2683 × 10^4
Engineering notation-32.683 × 10^3
In other bases
Ternary1122211111base 3; the most digit-efficient integer base after e: 10 digits
Quinary2021213base 5; one hand: 7 digits
Septenary164200base 7: 6 digits
Nonary48744base 9; each digit is two ternary digits: 5 digits
Duodecimal16ab7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal41e3base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:4:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11001TTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000000001010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000000001010101
Bit length15 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits3within that length
Bit parityeven12 set bits, so even; 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 ab
Gray code100000001111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000000001010101two's complement
32-bit11111111111111111000000001010101two's complement
64-bit1111111111111111111111111111111111111111111111111000000001010101two's complement
One's complement0111111110101010at 16 bits, every bit flipped
Bits reversed1010101000000001at 16 bits
Rotated left by 10000000010101011at 16 bits, wrapping
Shifted left by 1-1111111101010110= -65,366, no wrap
Shifted right by 1-11111111010110= -16,341, discarding the low bit
These bits as a double1.61475475 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-32,683 to the power 21,068,178,489
-32,683 to the power 3-34,911,277,555,987
-32,683 to the power 41,141,005,284,362,323,121
-32,683 to the power 5-37,291,475,708,813,806,563,643
First ten multiples-32,683, -65,366, -98,049, -130,732, -163,415, -196,098, -228,781, -261,464, -294,147, -326,830
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 83
As a percentage & fraction
As a percentage-3,268,300%
-32,683% as a decimal-326.83
-32,683% of 100-32,683
-32,683% of 1,000-326,830
As a fraction of 100-32,683/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -32,683
Nerdulate something else
Nothing in mind? Surprise me · today’s page