Recognised as Number
-136,373
- Negative
- Odd
- 6 digits
-136,373 is an odd 6-digit integer and the negative of 136,373. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value136,373
Digit count6
Digit sum23
Digit product1,134
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 136,373
Distinct prime factors1136,373
Number of divisors2
Sum of divisors σ(n)136,374
SquarefreeYesno repeated prime factor
All divisors1, 136,3732 in total
Arithmetic
Representations
Decimal-136,373
Binary10000101001011010118 bits
Octal412265
Hexadecimal214B5
Base 362X85
In wordsminus one hundred and thirty-six thousand, three hundred and seventy-three
Ordinalminus one hundred and thirty-six thousand, three hundred and seventy-third
Scientific notation-1.36373 × 10^5
Engineering notation-136.373 × 10^3
In other bases
Ternary20221001212base 3; the most digit-efficient integer base after e: 11 digits
Quinary13330443base 5; one hand: 8 digits
Septenary1105406base 7: 7 digits
Nonary227055base 9; each digit is two ternary digits: 6 digits
Duodecimal66b05base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh0idbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:52:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T01T0T1011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011111101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110101101001011
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 b5
Gray code110001111011101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110101101001011two's complement
64-bit1111111111111111111111111111111111111111111111011110101101001011two's complement
One's complement00000000000000100001010010110100at 32 bits, every bit flipped
Bits reversed11010010110101111011111111111111at 32 bits
Rotated left by 111111111111110111101011010010111at 32 bits, wrapping
Shifted left by 1-1000010100101101010= -272,746, no wrap
Shifted right by 1-10000101001011011= -68,186, discarding the low bit
These bits as a double6.73772143 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-136,373 to the power 218,597,595,129
-136,373 to the power 3-2,536,209,840,527,117
-136,373 to the power 4345,870,544,582,204,526,641
-136,373 to the power 5-47,167,403,776,308,977,911,613,093
First ten multiples-136,373, -272,746, -409,119, -545,492, -681,865, -818,238, -954,611, -1,090,984, -1,227,357, -1,363,730
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 73
As a percentage & fraction
As a percentage-13,637,300%
-136,373% as a decimal-1,363.73
-136,373% of 100-136,373
-136,373% of 1,000-1,363,730
As a fraction of 100-136,373/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -136,373
Nerdulate something else
Nothing in mind? Surprise me · today’s page