Recognised as Number
-106,760
- Negative
- Even
- 6 digits
-106,760 is an even 6-digit integer and the negative of 106,760. It has 32 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value106,760
Digit count6
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^3 × 5 × 17 × 157
Distinct prime factors42, 5, 17, 157
Number of divisors32
Sum of divisors σ(n)255,960
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 17, 20, 34, 40, 68, 85, 136, 157, 170, 314, 340, 628, 680, 785, 1,256, 1,570, 2,669, 3,140, 5,338, 6,280, 10,676, 13,345, 21,352, 26,690, 53,380, 106,76032 in total
Arithmetic
Representations
Decimal-106,760
Binary1101000010000100017 bits
Octal320410
Hexadecimal1A108
Base 362ADK
In wordsminus one hundred and six thousand, seven hundred and sixty
Ordinalminus one hundred and six thousand, seven hundred and sixtieth
Scientific notation-1.0676 × 10^5
Engineering notation-106.76 × 10^3
In other bases
Ternary12102110002base 3; the most digit-efficient integer base after e: 11 digits
Quinary11404020base 5; one hand: 8 digits
Septenary623153base 7: 6 digits
Nonary172402base 9; each digit is two ternary digits: 6 digits
Duodecimal51948base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimald6i0base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal29:39:20base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11TT1TT00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010001100001000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101111011111000
Bit length17 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits12within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes301 a1 08
Gray code10111000110001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101111011111000two's complement
64-bit1111111111111111111111111111111111111111111111100101111011111000two's complement
One's complement00000000000000011010000100000111at 32 bits, every bit flipped
Bits reversed00011111011110100111111111111111at 32 bits
Rotated left by 111111111111111001011110111110001at 32 bits, wrapping
Shifted left by 1-110100001000010000= -213,520, no wrap
Shifted right by 1-1101000010000100= -53,380, discarding the low bit
These bits as a double5.27464484 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-106,760 to the power 211,397,697,600
-106,760 to the power 3-1,216,818,195,776,000
-106,760 to the power 4129,907,510,581,045,760,000
-106,760 to the power 5-13,868,925,829,632,445,337,600,000
First ten multiples-106,760, -213,520, -320,280, -427,040, -533,800, -640,560, -747,320, -854,080, -960,840, -1,067,600
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 5
Divisible by 12No, remainder 8
Divisible by 100No, remainder 60
As a percentage & fraction
As a percentage-10,676,000%
-106,760% as a decimal-1,067.6
-106,760% of 100-106,760
-106,760% of 1,000-1,067,600
As a fraction of 100-106,760/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -106,760
Nerdulate something else
Nothing in mind? Surprise me · today’s page