Recognised as Number
-135,997
- Negative
- Odd
- 6 digits
-135,997 is an odd 6-digit integer and the negative of 135,997. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value135,997
Digit count6
Digit sum34
Digit product8,505
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 31 × 41 × 107
Distinct prime factors331, 41, 107
Number of divisors8
Sum of divisors σ(n)145,152
SquarefreeYesno repeated prime factor
All divisors1, 31, 41, 107, 1,271, 3,317, 4,387, 135,9978 in total
Arithmetic
Representations
Decimal-135,997
Binary10000100110011110118 bits
Octal411475
Hexadecimal2133D
Base 362WXP
In wordsminus one hundred and thirty-five thousand, nine hundred and ninety-seven
Ordinalminus one hundred and thirty-five thousand, nine hundred and ninety-seventh
Scientific notation-1.35997 × 10^5
Engineering notation-135.997 × 10^3
In other bases
Ternary20220112221base 3; the most digit-efficient integer base after e: 11 digits
Quinary13322442base 5; one hand: 8 digits
Septenary1104331base 7: 7 digits
Nonary226487base 9; each digit is two ternary digits: 6 digits
Duodecimal66851base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgjjhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:46:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T01T11001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011110111000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110110011000011
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 3d
Gray code110001101010100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110110011000011two's complement
64-bit1111111111111111111111111111111111111111111111011110110011000011two's complement
One's complement00000000000000100001001100111100at 32 bits, every bit flipped
Bits reversed11000011001101111011111111111111at 32 bits
Rotated left by 111111111111110111101100110000111at 32 bits, wrapping
Shifted left by 1-1000010011001111010= -271,994, no wrap
Shifted right by 1-10000100110011111= -67,998, discarding the low bit
These bits as a double6.71914456 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-135,997 to the power 218,495,184,009
-135,997 to the power 3-2,515,289,539,671,973
-135,997 to the power 4342,071,831,526,769,312,081
-135,997 to the power 5-46,520,742,872,146,046,135,079,757
First ten multiples-135,997, -271,994, -407,991, -543,988, -679,985, -815,982, -951,979, -1,087,976, -1,223,973, -1,359,970
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-13,599,700%
-135,997% as a decimal-1,359.97
-135,997% of 100-135,997
-135,997% of 1,000-1,359,970
As a fraction of 100-135,997/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -135,997
Nerdulate something else
Nothing in mind? Surprise me · today’s page