Recognised as Number
-325,132
- Negative
- Even
- 6 digits
-325,132 is an even 6-digit integer and the negative of 325,132. It has 6 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value325,132
Digit count6
Digit sum16
Digit product180
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 × 2^2 × 81,283
Distinct prime factors22, 81,283
Number of divisors6
Sum of divisors σ(n)568,988
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 81,283, 162,566, 325,1326 in total
Arithmetic
Representations
Decimal-325,132
Binary100111101100000110019 bits
Octal1173014
Hexadecimal4F60C
Base 366YVG
In wordsminus three hundred and twenty-five thousand, one hundred and thirty-two
Ordinalminus three hundred and twenty-five thousand, one hundred and thirty-second
Scientific notation-3.25132 × 10^5
Engineering notation-325.132 × 10^3
In other bases
Ternary121111222221base 3; the most digit-efficient integer base after e: 12 digits
Quinary40401012base 5; one hand: 8 digits
Septenary2522623base 7: 7 digits
Nonary544887base 9; each digit is two ternary digits: 6 digits
Duodecimal1381a4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal20cgcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:30:18:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10111100001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110001111000110100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110110000100111110100
Bit length19 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits10within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes304 f6 0c
Gray code1101000110100001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110110000100111110100two's complement
64-bit1111111111111111111111111111111111111111111110110000100111110100two's complement
One's complement00000000000001001111011000001011at 32 bits, every bit flipped
Bits reversed00101111100100001101111111111111at 32 bits
Rotated left by 111111111111101100001001111101001at 32 bits, wrapping
Shifted left by 1-10011110110000011000= -650,264, no wrap
Shifted right by 1-100111101100000110= -162,566, discarding the low bit
These bits as a double1.60636552 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-325,132 to the power 2105,710,817,424
-325,132 to the power 3-34,369,969,490,699,968
-325,132 to the power 411,174,776,920,450,261,995,776
-325,132 to the power 5-3,633,277,569,699,834,583,210,642,432
First ten multiples-325,132, -650,264, -975,396, -1,300,528, -1,625,660, -1,950,792, -2,275,924, -2,601,056, -2,926,188, -3,251,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 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 5
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32
As a percentage & fraction
As a percentage-32,513,200%
-325,132% as a decimal-3,251.32
-325,132% of 100-325,132
-325,132% of 1,000-3,251,320
As a fraction of 100-325,132/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -325,132
Nerdulate something else
Nothing in mind? Surprise me · today’s page