Recognised as Number
-27,043
- Negative
- Odd
- 5 digits
-27,043 is an odd 5-digit integer and the negative of 27,043. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value27,043
Digit count5
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 27,043
Distinct prime factors127,043
Number of divisors2
Sum of divisors σ(n)27,044
SquarefreeYesno repeated prime factor
All divisors1, 27,0432 in total
Arithmetic
Representations
Decimal-27,043
Binary11010011010001115 bits
Octal64643
Hexadecimal69A3
Base 36KV7
In wordsminus twenty-seven thousand and forty-three
Ordinalminus twenty-seven thousand and forty-third
Scientific notation-2.7043 × 10^4
Engineering notation-27.043 × 10^3
In other bases
Ternary1101002121base 3; the most digit-efficient integer base after e: 10 digits
Quinary1331133base 5; one hand: 7 digits
Septenary141562base 7: 6 digits
Nonary41077base 9; each digit is two ternary digits: 5 digits
Duodecimal13797base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal37c3base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:30:43base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT0T0T011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110101110101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001011001011101
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
Bytes269 a3
Gray code101110101110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001011001011101two's complement
32-bit11111111111111111001011001011101two's complement
64-bit1111111111111111111111111111111111111111111111111001011001011101two's complement
One's complement0110100110100010at 16 bits, every bit flipped
Bits reversed1011101001101001at 16 bits
Rotated left by 10010110010111011at 16 bits, wrapping
Shifted left by 1-1101001101000110= -54,086, no wrap
Shifted right by 1-11010011010010= -13,521, discarding the low bit
These bits as a double1.33610173 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-27,043 to the power 2731,323,849
-27,043 to the power 3-19,777,190,848,507
-27,043 to the power 4534,834,572,116,174,801
-27,043 to the power 5-14,463,531,333,737,715,143,443
First ten multiples-27,043, -54,086, -81,129, -108,172, -135,215, -162,258, -189,301, -216,344, -243,387, -270,430
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 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43
As a percentage & fraction
As a percentage-2,704,300%
-27,043% as a decimal-270.43
-27,043% of 100-27,043
-27,043% of 1,000-270,430
As a fraction of 100-27,043/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -27,043
Nerdulate something else
Nothing in mind? Surprise me · today’s page