Recognised as Number
-27,147
- Negative
- Odd
- 5 digits
-27,147 is an odd 5-digit integer and the negative of 27,147. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value27,147
Digit count5
Digit sum21
Digit product392
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 9,049
Distinct prime factors23, 9,049
Number of divisors4
Sum of divisors σ(n)36,200
SquarefreeYesno repeated prime factor
All divisors1, 3, 9,049, 27,1474 in total
Arithmetic
Representations
Decimal-27,147
Binary11010100000101115 bits
Octal65013
Hexadecimal6A0B
Base 36KY3
In wordsminus twenty-seven thousand, one hundred and forty-seven
Ordinalminus twenty-seven thousand, one hundred and forty-seventh
Scientific notation-2.7147 × 10^4
Engineering notation-27.147 × 10^3
In other bases
Ternary1101020110base 3; the most digit-efficient integer base after e: 10 digits
Quinary1332042base 5; one hand: 7 digits
Septenary142101base 7: 6 digits
Nonary41213base 9; each digit is two ternary digits: 5 digits
Duodecimal13863base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal37h7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:32:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT0TT10TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110101000110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001010111110101
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 set bits, so odd; 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 0b
Gray code101111100001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001010111110101two's complement
32-bit11111111111111111001010111110101two's complement
64-bit1111111111111111111111111111111111111111111111111001010111110101two's complement
One's complement0110101000001010at 16 bits, every bit flipped
Bits reversed1010111110101001at 16 bits
Rotated left by 10010101111101011at 16 bits, wrapping
Shifted left by 1-1101010000010110= -54,294, no wrap
Shifted right by 1-11010100000110= -13,573, discarding the low bit
These bits as a double1.34124001 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-27,147 to the power 2736,959,609
-27,147 to the power 3-20,006,242,505,523
-27,147 to the power 4543,109,465,297,432,881
-27,147 to the power 5-14,743,792,654,429,410,420,507
First ten multiples-27,147, -54,294, -81,441, -108,588, -135,735, -162,882, -190,029, -217,176, -244,323, -271,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 47
As a percentage & fraction
As a percentage-2,714,700%
-27,147% as a decimal-271.47
-27,147% of 100-27,147
-27,147% of 1,000-271,470
As a fraction of 100-27,147/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -27,147
Nerdulate something else
Nothing in mind? Surprise me · today’s page