Recognised as Number
-27,391
- Negative
- Odd
- 5 digits
-27,391 is an odd 5-digit integer and the negative of 27,391. It has 12 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value27,391
Digit count5
Digit sum22
Digit product378
Multiplicative persistence5times 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 × 13 × 43
Distinct prime factors37, 13, 43
Number of divisors12
Sum of divisors σ(n)35,112
SquarefreeNohas a repeated prime factor
All divisors1, 7, 13, 43, 49, 91, 301, 559, 637, 2,107, 3,913, 27,39112 in total
Arithmetic
Representations
Decimal-27,391
Binary11010101111111115 bits
Octal65377
Hexadecimal6AFF
Base 36L4V
In wordsminus twenty-seven thousand, three hundred and ninety-one
Ordinalminus twenty-seven thousand, three hundred and ninety-first
Scientific notation-2.7391 × 10^4
Engineering notation-27.391 × 10^3
In other bases
Ternary1101120111base 3; the most digit-efficient integer base after e: 10 digits
Quinary1334031base 5; one hand: 7 digits
Septenary142600base 7: 6 digits
Nonary41514base 9; each digit is two ternary digits: 5 digits
Duodecimal13a27base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal389bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:36:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTT1110TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001010100000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001010100000001
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
Bytes26a ff
Gray code101111110000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001010100000001two's complement
32-bit11111111111111111001010100000001two's complement
64-bit1111111111111111111111111111111111111111111111111001010100000001two's complement
One's complement0110101011111110at 16 bits, every bit flipped
Bits reversed1000000010101001at 16 bits
Rotated left by 10010101000000011at 16 bits, wrapping
Shifted left by 1-1101010111111110= -54,782, no wrap
Shifted right by 1-11010110000000= -13,695, discarding the low bit
These bits as a double1.35329521 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-27,391 to the power 2750,266,881
-27,391 to the power 3-20,550,560,137,471
-27,391 to the power 4562,900,392,725,468,161
-27,391 to the power 5-15,418,404,657,143,298,397,951
First ten multiples-27,391, -54,782, -82,173, -109,564, -136,955, -164,346, -191,737, -219,128, -246,519, -273,910
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 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-2,739,100%
-27,391% as a decimal-273.91
-27,391% of 100-27,391
-27,391% of 1,000-273,910
As a fraction of 100-27,391/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -27,391
Nerdulate something else
Nothing in mind? Surprise me · today’s page