Recognised as Number
-398,482
- Negative
- Even
- 6 digits
-398,482 is an even 6-digit integer and the negative of 398,482. It has 8 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value398,482
Digit count6
Digit sum34
Digit product13,824
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 7 × 28,463
Distinct prime factors32, 7, 28,463
Number of divisors8
Sum of divisors σ(n)683,136
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 14, 28,463, 56,926, 199,241, 398,4828 in total
Arithmetic
Representations
Decimal-398,482
Binary110000101001001001019 bits
Octal1412222
Hexadecimal61492
Base 368JGY
In wordsminus three hundred and ninety-eight thousand, four hundred and eighty-two
Ordinalminus three hundred and ninety-eight thousand, four hundred and eighty-second
Scientific notation-3.98482 × 10^5
Engineering notation-398.482 × 10^3
In other bases
Ternary202020121121base 3; the most digit-efficient integer base after e: 12 digits
Quinary100222412base 5; one hand: 9 digits
Septenary3246520base 7: 7 digits
Nonary666547base 9; each digit is two ternary digits: 6 digits
Duodecimal17272abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal29g42base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:50:41:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T1T1T10111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100011110010110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110011110101101101110
Bit length19 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits12within that length
Bit parityodd7 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 92
Gray code1010001111011011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110011110101101101110two's complement
64-bit1111111111111111111111111111111111111111111110011110101101101110two's complement
One's complement00000000000001100001010010010001at 32 bits, every bit flipped
Bits reversed01110110110101111001111111111111at 32 bits
Rotated left by 111111111111100111101011011011101at 32 bits, wrapping
Shifted left by 1-11000010100100100100= -796,964, no wrap
Shifted right by 1-110000101001001001= -199,241, discarding the low bit
These bits as a double1.96876267 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-398,482 to the power 2158,787,904,324
-398,482 to the power 3-63,274,121,690,836,168
-398,482 to the power 425,213,598,559,607,777,896,976
-398,482 to the power 5-10,047,165,181,229,626,551,942,790,432
First ten multiples-398,482, -796,964, -1,195,446, -1,593,928, -1,992,410, -2,390,892, -2,789,374, -3,187,856, -3,586,338, -3,984,820
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 2
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 7
Divisible by 12No, remainder 10
Divisible by 100No, remainder 82
As a percentage & fraction
As a percentage-39,848,200%
-398,482% as a decimal-3,984.82
-398,482% of 100-398,482
-398,482% of 1,000-3,984,820
As a fraction of 100-398,482/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -398,482
Nerdulate something else
Nothing in mind? Surprise me · today’s page