Recognised as Number
-27,331
- Negative
- Odd
- 5 digits
-27,331 is an odd 5-digit integer and the negative of 27,331. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value27,331
Digit count5
Digit sum16
Digit product126
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 151 × 181
Distinct prime factors2151, 181
Number of divisors4
Sum of divisors σ(n)27,664
SquarefreeYesno repeated prime factor
All divisors1, 151, 181, 27,3314 in total
Arithmetic
Representations
Decimal-27,331
Binary11010101100001115 bits
Octal65303
Hexadecimal6AC3
Base 36L37
In wordsminus twenty-seven thousand, three hundred and thirty-one
Ordinalminus twenty-seven thousand, three hundred and thirty-first
Scientific notation-2.7331 × 10^4
Engineering notation-27.331 × 10^3
In other bases
Ternary1101111021base 3; the most digit-efficient integer base after e: 10 digits
Quinary1333311base 5; one hand: 7 digits
Septenary142453base 7: 6 digits
Nonary41437base 9; each digit is two ternary digits: 5 digits
Duodecimal13997base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal386bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:35:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT0TTTTT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001010101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001010100111101
Bit length15 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits7within that length
Bit parityeven8 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
Bytes26a c3
Gray code101111110100010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001010100111101two's complement
32-bit11111111111111111001010100111101two's complement
64-bit1111111111111111111111111111111111111111111111111001010100111101two's complement
One's complement0110101011000010at 16 bits, every bit flipped
Bits reversed1011110010101001at 16 bits
Rotated left by 10010101001111011at 16 bits, wrapping
Shifted left by 1-1101010110000110= -54,662, no wrap
Shifted right by 1-11010101100010= -13,665, discarding the low bit
These bits as a double1.35033082 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-27,331 to the power 2746,983,561
-27,331 to the power 3-20,415,807,705,691
-27,331 to the power 4557,984,440,404,240,721
-27,331 to the power 5-15,250,272,740,688,303,145,651
First ten multiples-27,331, -54,662, -81,993, -109,324, -136,655, -163,986, -191,317, -218,648, -245,979, -273,310
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
As a percentage & fraction
As a percentage-2,733,100%
-27,331% as a decimal-273.31
-27,331% of 100-27,331
-27,331% of 1,000-273,310
As a fraction of 100-27,331/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -27,331
Nerdulate something else
Nothing in mind? Surprise me · today’s page