Recognised as Number
-331,132
- Negative
- Even
- 6 digits
-331,132 is an even 6-digit integer and the negative of 331,132. It has 12 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value331,132
Digit count6
Digit sum13
Digit product54
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 19 × 4,357
Distinct prime factors32, 19, 4,357
Number of divisors12
Sum of divisors σ(n)610,120
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 19, 38, 76, 4,357, 8,714, 17,428, 82,783, 165,566, 331,13212 in total
Arithmetic
Representations
Decimal-331,132
Binary101000011010111110019 bits
Octal1206574
Hexadecimal50D7C
Base 3673I4
In wordsminus three hundred and thirty-one thousand, one hundred and thirty-two
Ordinalminus three hundred and thirty-one thousand, one hundred and thirty-second
Scientific notation-3.31132 × 10^5
Engineering notation-331.132 × 10^3
In other bases
Ternary121211020011base 3; the most digit-efficient integer base after e: 12 digits
Quinary41044012base 5; one hand: 8 digits
Septenary2546254base 7: 7 digits
Nonary554204base 9; each digit is two ternary digits: 6 digits
Duodecimal13b764base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal217gcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:31:58:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1011TTT100TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110011011110000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110101111001010000100
Bit length19 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits9within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes305 0d 7c
Gray code1111000101111000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110101111001010000100two's complement
64-bit1111111111111111111111111111111111111111111110101111001010000100two's complement
One's complement00000000000001010000110101111011at 32 bits, every bit flipped
Bits reversed00100001010011110101111111111111at 32 bits
Rotated left by 111111111111101011110010100001001at 32 bits, wrapping
Shifted left by 1-10100001101011111000= -662,264, no wrap
Shifted right by 1-101000011010111110= -165,566, discarding the low bit
These bits as a double1.63600945 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-331,132 to the power 2109,648,401,424
-331,132 to the power 3-36,308,094,460,331,968
-331,132 to the power 412,022,771,934,838,645,227,776
-331,132 to the power 5-3,981,124,516,326,990,271,563,922,432
First ten multiples-331,132, -662,264, -993,396, -1,324,528, -1,655,660, -1,986,792, -2,317,924, -2,649,056, -2,980,188, -3,311,320
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32
As a percentage & fraction
As a percentage-33,113,200%
-331,132% as a decimal-3,311.32
-331,132% of 100-331,132
-331,132% of 1,000-3,311,320
As a fraction of 100-331,132/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -331,132
Nerdulate something else
Nothing in mind? Surprise me · today’s page