Recognised as Number
-325,010
- Negative
- Even
- 6 digits
-325,010 is an even 6-digit integer and the negative of 325,010. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value325,010
Digit count6
Digit sum11
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 × 5 × 7 × 4,643
Distinct prime factors42, 5, 7, 4,643
Number of divisors16
Sum of divisors σ(n)668,736
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 7, 10, 14, 35, 70, 4,643, 9,286, 23,215, 32,501, 46,430, 65,002, 162,505, 325,01016 in total
Arithmetic
Representations
Decimal-325,010
Binary100111101011001001019 bits
Octal1172622
Hexadecimal4F592
Base 366YS2
In wordsminus three hundred and twenty-five thousand and ten
Ordinalminus three hundred and twenty-five thousand and tenth
Scientific notation-3.2501 × 10^5
Engineering notation-325.01 × 10^3
In other bases
Ternary121111211102base 3; the most digit-efficient integer base after e: 12 digits
Quinary40400020base 5; one hand: 8 digits
Septenary2522360base 7: 7 digits
Nonary544742base 9; each digit is two ternary digits: 6 digits
Duodecimal138102base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal20caabase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:30:16:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1011111TTTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110001111110110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110110000101001101110
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 11 trailing zero
Power of twoNo
Bytes304 f5 92
Gray code1101000111101011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110110000101001101110two's complement
64-bit1111111111111111111111111111111111111111111110110000101001101110two's complement
One's complement00000000000001001111010110010001at 32 bits, every bit flipped
Bits reversed01110110010100001101111111111111at 32 bits
Rotated left by 111111111111101100001010011011101at 32 bits, wrapping
Shifted left by 1-10011110101100100100= -650,020, no wrap
Shifted right by 1-100111101011001001= -162,505, discarding the low bit
These bits as a double1.60576276 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-325,010 to the power 2105,631,500,100
-325,010 to the power 3-34,331,293,847,501,000
-325,010 to the power 411,158,013,813,376,300,010,000
-325,010 to the power 5-3,626,466,069,485,431,266,250,100,000
First ten multiples-325,010, -650,020, -975,030, -1,300,040, -1,625,050, -1,950,060, -2,275,070, -2,600,080, -2,925,090, -3,250,100
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 2
Divisible by 100No, remainder 10
As a percentage & fraction
As a percentage-32,501,000%
-325,010% as a decimal-3,250.1
-325,010% of 100-325,010
-325,010% of 1,000-3,250,100
As a fraction of 100-325,010/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -325,010
Nerdulate something else
Nothing in mind? Surprise me · today’s page