Recognised as Number
-137,271
- Negative
- Odd
- 6 digits
-137,271 is an odd 6-digit integer and the negative of 137,271. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value137,271
Digit count6
Digit sum21
Digit product294
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 × 45,757
Distinct prime factors23, 45,757
Number of divisors4
Sum of divisors σ(n)183,032
SquarefreeYesno repeated prime factor
All divisors1, 3, 45,757, 137,2714 in total
Arithmetic
Representations
Decimal-137,271
Binary10000110000011011118 bits
Octal414067
Hexadecimal21837
Base 362XX3
In wordsminus one hundred and thirty-seven thousand, two hundred and seventy-one
Ordinalminus one hundred and thirty-seven thousand, two hundred and seventy-first
Scientific notation-1.37271 × 10^5
Engineering notation-137.271 × 10^3
In other bases
Ternary20222022010base 3; the most digit-efficient integer base after e: 11 digits
Quinary13343041base 5; one hand: 8 digits
Septenary1111131base 7: 7 digits
Nonary228263base 9; each digit is two ternary digits: 6 digits
Duodecimal67533base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh33bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:7:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T001T010T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011100011011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110011111001001
Bit length18 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits10within that length
Bit parityeven8 set bits, so even; 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 18 37
Gray code110001010000101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110011111001001two's complement
64-bit1111111111111111111111111111111111111111111111011110011111001001two's complement
One's complement00000000000000100001100000110110at 32 bits, every bit flipped
Bits reversed10010011111001111011111111111111at 32 bits
Rotated left by 111111111111110111100111110010011at 32 bits, wrapping
Shifted left by 1-1000011000001101110= -274,542, no wrap
Shifted right by 1-10000110000011100= -68,635, discarding the low bit
These bits as a double6.78208853 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-137,271 to the power 218,843,327,441
-137,271 to the power 3-2,586,642,401,153,511
-137,271 to the power 4355,070,989,048,743,608,481
-137,271 to the power 5-48,740,949,737,710,083,879,795,351
First ten multiples-137,271, -274,542, -411,813, -549,084, -686,355, -823,626, -960,897, -1,098,168, -1,235,439, -1,372,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 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-13,727,100%
-137,271% as a decimal-1,372.71
-137,271% of 100-137,271
-137,271% of 1,000-1,372,710
As a fraction of 100-137,271/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -137,271
Nerdulate something else
Nothing in mind? Surprise me · today’s page