Recognised as Number
-135,707
- Negative
- Odd
- 6 digits
-135,707 is an odd 6-digit integer and the negative of 135,707. It has 12 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value135,707
Digit count6
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 11 × 13^2 × 73
Distinct prime factors311, 13, 73
Number of divisors12
Sum of divisors σ(n)162,504
SquarefreeNohas a repeated prime factor
All divisors1, 11, 13, 73, 143, 169, 803, 949, 1,859, 10,439, 12,337, 135,70712 in total
Arithmetic
Representations
Decimal-135,707
Binary10000100100001101118 bits
Octal411033
Hexadecimal2121B
Base 362WPN
In wordsminus one hundred and thirty-five thousand, seven hundred and seven
Ordinalminus one hundred and thirty-five thousand, seven hundred and seventh
Scientific notation-1.35707 × 10^5
Engineering notation-135.707 × 10^3
In other bases
Ternary20220011012base 3; the most digit-efficient integer base after e: 11 digits
Quinary13320312base 5; one hand: 8 digits
Septenary1103435base 7: 7 digits
Nonary226135base 9; each digit is two ternary digits: 6 digits
Duodecimal6664bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgj57base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:41:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T0100TTT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011001000100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110110111100101
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 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 12 1b
Gray code110001101100010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110110111100101two's complement
64-bit1111111111111111111111111111111111111111111111011110110111100101two's complement
One's complement00000000000000100001001000011010at 32 bits, every bit flipped
Bits reversed10100111101101111011111111111111at 32 bits
Rotated left by 111111111111110111101101111001011at 32 bits, wrapping
Shifted left by 1-1000010010000110110= -271,414, no wrap
Shifted right by 1-10000100100001110= -67,853, discarding the low bit
These bits as a double6.70481666 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-135,707 to the power 218,416,389,849
-135,707 to the power 3-2,499,233,017,238,243
-135,707 to the power 4339,163,415,070,350,242,801
-135,707 to the power 5-46,026,849,568,952,020,399,795,307
First ten multiples-135,707, -271,414, -407,121, -542,828, -678,535, -814,242, -949,949, -1,085,656, -1,221,363, -1,357,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11Yes
Divisible by 12No, remainder 11
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-13,570,700%
-135,707% as a decimal-1,357.07
-135,707% of 100-135,707
-135,707% of 1,000-1,357,070
As a fraction of 100-135,707/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -135,707
Nerdulate something else
Nothing in mind? Surprise me · today’s page