Recognised as Number
-140,271
- Negative
- Odd
- 6 digits
-140,271 is an odd 6-digit integer and the negative of 140,271. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value140,271
Digit count6
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 46,757
Distinct prime factors23, 46,757
Number of divisors4
Sum of divisors σ(n)187,032
SquarefreeYesno repeated prime factor
All divisors1, 3, 46,757, 140,2714 in total
Arithmetic
Representations
Decimal-140,271
Binary10001000111110111118 bits
Octal421757
Hexadecimal223EF
Base 36308F
In wordsminus one hundred and forty thousand, two hundred and seventy-one
Ordinalminus one hundred and forty thousand, two hundred and seventy-first
Scientific notation-1.40271 × 10^5
Engineering notation-140.271 × 10^3
In other bases
Ternary21010102020base 3; the most digit-efficient integer base after e: 11 digits
Quinary13442041base 5; one hand: 8 digits
Septenary1122645base 7: 7 digits
Nonary233366base 9; each digit is two ternary digits: 6 digits
Duodecimal69213base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalhadbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:57:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T0T0TT1T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010110000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011101110000010001
Bit length18 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits7within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 23 ef
Gray code110011001000011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011101110000010001two's complement
64-bit1111111111111111111111111111111111111111111111011101110000010001two's complement
One's complement00000000000000100010001111101110at 32 bits, every bit flipped
Bits reversed10001000001110111011111111111111at 32 bits
Rotated left by 111111111111110111011100000100011at 32 bits, wrapping
Shifted left by 1-1000100011111011110= -280,542, no wrap
Shifted right by 1-10001000111111000= -70,135, discarding the low bit
These bits as a double6.93030822 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-140,271 to the power 219,675,953,441
-140,271 to the power 3-2,759,965,665,122,511
-140,271 to the power 4387,143,143,812,399,740,481
-140,271 to the power 5-54,304,955,925,709,123,997,010,351
First ten multiples-140,271, -280,542, -420,813, -561,084, -701,355, -841,626, -981,897, -1,122,168, -1,262,439, -1,402,710
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-14,027,100%
-140,271% as a decimal-1,402.71
-140,271% of 100-140,271
-140,271% of 1,000-1,402,710
As a fraction of 100-140,271/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -140,271
Nerdulate something else
Nothing in mind? Surprise me · today’s page