Recognised as Number
-136,107
- Negative
- Odd
- 6 digits
-136,107 is an odd 6-digit integer and the negative of 136,107. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value136,107
Digit count6
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^3 × 71^2
Distinct prime factors23, 71
Number of divisors12
Sum of divisors σ(n)204,520
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 71, 213, 639, 1,917, 5,041, 15,123, 45,369, 136,10712 in total
Arithmetic
Representations
Decimal-136,107
Binary10000100111010101118 bits
Octal411653
Hexadecimal213AB
Base 362X0R
In wordsminus one hundred and thirty-six thousand, one hundred and seven
Ordinalminus one hundred and thirty-six thousand, one hundred and seventh
Scientific notation-1.36107 × 10^5
Engineering notation-136.107 × 10^3
In other bases
Ternary20220201000base 3; the most digit-efficient integer base after e: 11 digits
Quinary13323412base 5; one hand: 8 digits
Septenary1104546base 7: 7 digits
Nonary226630base 9; each digit is two ternary digits: 6 digits
Duodecimal66923base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh057base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:48:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T01T10T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011110001010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110110001010101
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 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 13 ab
Gray code110001101001111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110110001010101two's complement
64-bit1111111111111111111111111111111111111111111111011110110001010101two's complement
One's complement00000000000000100001001110101010at 32 bits, every bit flipped
Bits reversed10101010001101111011111111111111at 32 bits
Rotated left by 111111111111110111101100010101011at 32 bits, wrapping
Shifted left by 1-1000010011101010110= -272,214, no wrap
Shifted right by 1-10000100111010110= -68,053, discarding the low bit
These bits as a double6.72457929 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-136,107 to the power 218,525,115,449
-136,107 to the power 3-2,521,397,888,417,043
-136,107 to the power 4343,179,902,398,778,471,601
-136,107 to the power 5-46,709,186,975,790,541,434,197,307
First ten multiples-136,107, -272,214, -408,321, -544,428, -680,535, -816,642, -952,749, -1,088,856, -1,224,963, -1,361,070
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-13,610,700%
-136,107% as a decimal-1,361.07
-136,107% of 100-136,107
-136,107% of 1,000-1,361,070
As a fraction of 100-136,107/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -136,107
Nerdulate something else
Nothing in mind? Surprise me · today’s page