Recognised as Number
-327,106
- Negative
- Even
- 6 digits
-327,106 is an even 6-digit integer and the negative of 327,106. It has 16 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value327,106
Digit count6
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 13 × 23 × 547
Distinct prime factors42, 13, 23, 547
Number of divisors16
Sum of divisors σ(n)552,384
SquarefreeYesno repeated prime factor
All divisors1, 2, 13, 23, 26, 46, 299, 547, 598, 1,094, 7,111, 12,581, 14,222, 25,162, 163,553, 327,10616 in total
Arithmetic
Representations
Decimal-327,106
Binary100111111011100001019 bits
Octal1176702
Hexadecimal4FDC2
Base 3670EA
In wordsminus three hundred and twenty-seven thousand, one hundred and six
Ordinalminus three hundred and twenty-seven thousand, one hundred and sixth
Scientific notation-3.27106 × 10^5
Engineering notation-327.106 × 10^3
In other bases
Ternary121121201001base 3; the most digit-efficient integer base after e: 12 digits
Quinary40431411base 5; one hand: 8 digits
Septenary2531443base 7: 7 digits
Nonary547631base 9; each digit is two ternary digits: 6 digits
Duodecimal13936abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal20hf6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:30:51:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10110110T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110000011001000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110110000001000111110
Bit length19 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits8within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes304 fd c2
Gray code1101000001100100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110110000001000111110two's complement
64-bit1111111111111111111111111111111111111111111110110000001000111110two's complement
One's complement00000000000001001111110111000001at 32 bits, every bit flipped
Bits reversed01111100010000001101111111111111at 32 bits
Rotated left by 111111111111101100000010001111101at 32 bits, wrapping
Shifted left by 1-10011111101110000100= -654,212, no wrap
Shifted right by 1-100111111011100001= -163,553, discarding the low bit
These bits as a double1.61611837 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-327,106 to the power 2106,998,335,236
-327,106 to the power 3-34,999,797,445,707,016
-327,106 to the power 411,448,643,743,275,439,175,696
-327,106 to the power 5-3,744,920,060,287,855,807,005,215,776
First ten multiples-327,106, -654,212, -981,318, -1,308,424, -1,635,530, -1,962,636, -2,289,742, -2,616,848, -2,943,954, -3,271,060
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 6
As a percentage & fraction
As a percentage-32,710,600%
-327,106% as a decimal-3,271.06
-327,106% of 100-327,106
-327,106% of 1,000-3,271,060
As a fraction of 100-327,106/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -327,106
Nerdulate something else
Nothing in mind? Surprise me · today’s page