Recognised as Number
-136,371
- Negative
- Odd
- 6 digits
-136,371 is an odd 6-digit integer and the negative of 136,371. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value136,371
Digit count6
Digit sum21
Digit product378
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 131 × 347
Distinct prime factors33, 131, 347
Number of divisors8
Sum of divisors σ(n)183,744
SquarefreeYesno repeated prime factor
All divisors1, 3, 131, 347, 393, 1,041, 45,457, 136,3718 in total
Arithmetic
Representations
Decimal-136,371
Binary10000101001011001118 bits
Octal412263
Hexadecimal214B3
Base 362X83
In wordsminus one hundred and thirty-six thousand, three hundred and seventy-one
Ordinalminus one hundred and thirty-six thousand, three hundred and seventy-first
Scientific notation-1.36371 × 10^5
Engineering notation-136.371 × 10^3
In other bases
Ternary20221001210base 3; the most digit-efficient integer base after e: 11 digits
Quinary13330441base 5; one hand: 8 digits
Septenary1105404base 7: 7 digits
Nonary227053base 9; each digit is two ternary digits: 6 digits
Duodecimal66b03base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh0ibbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:52:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T01T0T11T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011111101011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110101101001101
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 14 b3
Gray code110001111011101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110101101001101two's complement
64-bit1111111111111111111111111111111111111111111111011110101101001101two's complement
One's complement00000000000000100001010010110010at 32 bits, every bit flipped
Bits reversed10110010110101111011111111111111at 32 bits
Rotated left by 111111111111110111101011010011011at 32 bits, wrapping
Shifted left by 1-1000010100101100110= -272,742, no wrap
Shifted right by 1-10000101001011010= -68,185, discarding the low bit
These bits as a double6.73762262 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-136,371 to the power 218,597,049,641
-136,371 to the power 3-2,536,098,256,592,811
-136,371 to the power 4345,850,255,349,818,228,881
-136,371 to the power 5-47,163,945,172,310,061,690,730,851
First ten multiples-136,371, -272,742, -409,113, -545,484, -681,855, -818,226, -954,597, -1,090,968, -1,227,339, -1,363,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 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-13,637,100%
-136,371% as a decimal-1,363.71
-136,371% of 100-136,371
-136,371% of 1,000-1,363,710
As a fraction of 100-136,371/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -136,371
Nerdulate something else
Nothing in mind? Surprise me · today’s page