Recognised as Number
-421,390
- Negative
- Even
- 6 digits
-421,390 is an even 6-digit integer and the negative of 421,390. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value421,390
Digit count6
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 42,139
Distinct prime factors32, 5, 42,139
Number of divisors8
Sum of divisors σ(n)758,520
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 42,139, 84,278, 210,695, 421,3908 in total
Arithmetic
Representations
Decimal-421,390
Binary110011011100000111019 bits
Octal1467016
Hexadecimal66E0E
Base 36915A
In wordsminus four hundred and twenty-one thousand, three hundred and ninety
Ordinalminus four hundred and twenty-one thousand, three hundred and ninetieth
Scientific notation-4.2139 × 10^5
Engineering notation-421.39 × 10^3
In other bases
Ternary210102001001base 3; the most digit-efficient integer base after e: 12 digits
Quinary101441030base 5; one hand: 9 digits
Septenary3403354base 7: 7 digits
Nonary712031base 9; each digit is two ternary digits: 6 digits
Duodecimal183a3abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2cd9abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:57:3:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T0TT100T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001011000110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110011001000111110010
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
Bytes306 6e 0e
Gray code1010101100100001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110011001000111110010two's complement
64-bit1111111111111111111111111111111111111111111110011001000111110010two's complement
One's complement00000000000001100110111000001101at 32 bits, every bit flipped
Bits reversed01001111100010011001111111111111at 32 bits
Rotated left by 111111111111100110010001111100101at 32 bits, wrapping
Shifted left by 1-11001101110000011100= -842,780, no wrap
Shifted right by 1-110011011100000111= -210,695, discarding the low bit
These bits as a double2.08194323 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-421,390 to the power 2177,569,532,100
-421,390 to the power 3-74,826,025,131,619,000
-421,390 to the power 431,530,938,730,212,930,410,000
-421,390 to the power 5-13,286,822,271,524,426,745,469,900,000
First ten multiples-421,390, -842,780, -1,264,170, -1,685,560, -2,106,950, -2,528,340, -2,949,730, -3,371,120, -3,792,510, -4,213,900
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
As a percentage & fraction
As a percentage-42,139,000%
-421,390% as a decimal-4,213.9
-421,390% of 100-421,390
-421,390% of 1,000-4,213,900
As a fraction of 100-421,390/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -421,390
Nerdulate something else
Nothing in mind? Surprise me · today’s page