Recognised as Number
-398,566
- Negative
- Even
- 6 digits
-398,566 is an even 6-digit integer and the negative of 398,566. It has 20 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value398,566
Digit count6
Digit sum37
Digit product38,880
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 7^4 × 83
Distinct prime factors32, 7, 83
Number of divisors20
Sum of divisors σ(n)705,852
SquarefreeNohas a repeated prime factor
All divisors1, 2, 7, 14, 49, 83, 98, 166, 343, 581, 686, 1,162, 2,401, 4,067, 4,802, 8,134, 28,469, 56,938, 199,283, 398,56620 in total
Arithmetic
Representations
Decimal-398,566
Binary110000101001110011019 bits
Octal1412346
Hexadecimal614E6
Base 368JJA
In wordsminus three hundred and ninety-eight thousand, five hundred and sixty-six
Ordinalminus three hundred and ninety-eight thousand, five hundred and sixty-sixth
Scientific notation-3.98566 × 10^5
Engineering notation-398.566 × 10^3
In other bases
Ternary202020201201base 3; the most digit-efficient integer base after e: 12 digits
Quinary100223231base 5; one hand: 9 digits
Septenary3250000base 7: 7 digits
Nonary666651base 9; each digit is two ternary digits: 6 digits
Duodecimal17279abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal29g86base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:50:42:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T1T1T1T110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100011111101101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110011110101100011010
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 11 trailing zero
Power of twoNo
Bytes306 14 e6
Gray code1010001111010010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110011110101100011010two's complement
64-bit1111111111111111111111111111111111111111111110011110101100011010two's complement
One's complement00000000000001100001010011100101at 32 bits, every bit flipped
Bits reversed01011000110101111001111111111111at 32 bits
Rotated left by 111111111111100111101011000110101at 32 bits, wrapping
Shifted left by 1-11000010100111001100= -797,132, no wrap
Shifted right by 1-110000101001110011= -199,283, discarding the low bit
These bits as a double1.96917768 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-398,566 to the power 2158,854,856,356
-398,566 to the power 3-63,314,144,678,385,496
-398,566 to the power 425,234,865,387,885,393,598,736
-398,566 to the power 5-10,057,759,358,187,929,785,073,812,576
First ten multiples-398,566, -797,132, -1,195,698, -1,594,264, -1,992,830, -2,391,396, -2,789,962, -3,188,528, -3,587,094, -3,985,660
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 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10No, remainder 6
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 66
As a percentage & fraction
As a percentage-39,856,600%
-398,566% as a decimal-3,985.66
-398,566% of 100-398,566
-398,566% of 1,000-3,985,660
As a fraction of 100-398,566/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -398,566
Nerdulate something else
Nothing in mind? Surprise me · today’s page