Recognised as Number
-27,393
- Negative
- Odd
- 5 digits
-27,393 is an odd 5-digit integer and the negative of 27,393. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value27,393
Digit count5
Digit sum24
Digit product1,134
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 23 × 397
Distinct prime factors33, 23, 397
Number of divisors8
Sum of divisors σ(n)38,208
SquarefreeYesno repeated prime factor
All divisors1, 3, 23, 69, 397, 1,191, 9,131, 27,3938 in total
Arithmetic
Representations
Decimal-27,393
Binary11010110000000115 bits
Octal65401
Hexadecimal6B01
Base 36L4X
In wordsminus twenty-seven thousand, three hundred and ninety-three
Ordinalminus twenty-seven thousand, three hundred and ninety-third
Scientific notation-2.7393 × 10^4
Engineering notation-27.393 × 10^3
In other bases
Ternary1101120120base 3; the most digit-efficient integer base after e: 10 digits
Quinary1334033base 5; one hand: 7 digits
Septenary142602base 7: 6 digits
Nonary41516base 9; each digit is two ternary digits: 5 digits
Duodecimal13a29base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal389dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:36:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTTT111T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001010100000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001010011111111
Bit length15 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits9within that length
Bit parityeven6 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
Bytes26b 01
Gray code101111010000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001010011111111two's complement
32-bit11111111111111111001010011111111two's complement
64-bit1111111111111111111111111111111111111111111111111001010011111111two's complement
One's complement0110101100000000at 16 bits, every bit flipped
Bits reversed1111111100101001at 16 bits
Rotated left by 10010100111111111at 16 bits, wrapping
Shifted left by 1-1101011000000010= -54,786, no wrap
Shifted right by 1-11010110000001= -13,696, discarding the low bit
These bits as a double1.35339402 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-27,393 to the power 2750,376,449
-27,393 to the power 3-20,555,062,067,457
-27,393 to the power 4563,064,815,213,849,601
-27,393 to the power 5-15,424,034,483,152,982,120,193
First ten multiples-27,393, -54,786, -82,179, -109,572, -136,965, -164,358, -191,751, -219,144, -246,537, -273,930
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 93
As a percentage & fraction
As a percentage-2,739,300%
-27,393% as a decimal-273.93
-27,393% of 100-27,393
-27,393% of 1,000-273,930
As a fraction of 100-27,393/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -27,393
Nerdulate something else
Nothing in mind? Surprise me · today’s page