Recognised as Number
-271,990
- Negative
- Even
- 6 digits
-271,990 is an even 6-digit integer and the negative of 271,990. It has 16 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value271,990
Digit count6
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 59 × 461
Distinct prime factors42, 5, 59, 461
Number of divisors16
Sum of divisors σ(n)498,960
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 59, 118, 295, 461, 590, 922, 2,305, 4,610, 27,199, 54,398, 135,995, 271,99016 in total
Arithmetic
Representations
Decimal-271,990
Binary100001001100111011019 bits
Octal1023166
Hexadecimal42676
Base 365TVA
In wordsminus two hundred and seventy-one thousand, nine hundred and ninety
Ordinalminus two hundred and seventy-one thousand, nine hundred and ninetieth
Scientific notation-2.7199 × 10^5
Engineering notation-271.99 × 10^3
In other bases
Ternary111211002201base 3; the most digit-efficient integer base after e: 12 digits
Quinary32200430base 5; one hand: 8 digits
Septenary2211655base 7: 7 digits
Nonary454081base 9; each digit is two ternary digits: 6 digits
Duodecimal11149abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal1djjabase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:15:33:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1111TT0T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010111010011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110111101100110001010
Bit length19 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits10within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes304 26 76
Gray code1100011010101001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110111101100110001010two's complement
64-bit1111111111111111111111111111111111111111111110111101100110001010two's complement
One's complement00000000000001000010011001110101at 32 bits, every bit flipped
Bits reversed01010001100110111101111111111111at 32 bits
Rotated left by 111111111111101111011001100010101at 32 bits, wrapping
Shifted left by 1-10000100110011101100= -543,980, no wrap
Shifted right by 1-100001001100111011= -135,995, discarding the low bit
These bits as a double1.34380915 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-271,990 to the power 273,978,560,100
-271,990 to the power 3-20,121,428,561,599,000
-271,990 to the power 45,472,827,354,469,312,010,000
-271,990 to the power 5-1,488,554,312,142,108,173,599,900,000
First ten multiples-271,990, -543,980, -815,970, -1,087,960, -1,359,950, -1,631,940, -1,903,930, -2,175,920, -2,447,910, -2,719,900
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
As a percentage & fraction
As a percentage-27,199,000%
-271,990% as a decimal-2,719.9
-271,990% of 100-271,990
-271,990% of 1,000-2,719,900
As a fraction of 100-271,990/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -271,990
Nerdulate something else
Nothing in mind? Surprise me · today’s page