Recognised as Number
-436,990
- Negative
- Even
- 6 digits
-436,990 is an even 6-digit integer and the negative of 436,990. It has 16 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value436,990
Digit count6
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 89 × 491
Distinct prime factors42, 5, 89, 491
Number of divisors16
Sum of divisors σ(n)797,040
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 89, 178, 445, 491, 890, 982, 2,455, 4,910, 43,699, 87,398, 218,495, 436,99016 in total
Arithmetic
Representations
Decimal-436,990
Binary110101010101111111019 bits
Octal1525376
Hexadecimal6AAFE
Base 369D6M
In wordsminus four hundred and thirty-six thousand, nine hundred and ninety
Ordinalminus four hundred and thirty-six thousand, nine hundred and ninetieth
Scientific notation-4.3699 × 10^5
Engineering notation-436.99 × 10^3
In other bases
Ternary211012102211base 3; the most digit-efficient integer base after e: 12 digits
Quinary102440430base 5; one hand: 9 digits
Septenary3500011base 7: 7 digits
Nonary735384base 9; each digit is two ternary digits: 6 digits
Duodecimal190a7abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2ec9abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal2:1:23:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1TTT11TT01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101010100000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110010101010100000010
Bit length19 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits6within that length
Bit parityodd13 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 aa fe
Gray code1011111111110000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110010101010100000010two's complement
64-bit1111111111111111111111111111111111111111111110010101010100000010two's complement
One's complement00000000000001101010101011111101at 32 bits, every bit flipped
Bits reversed01000000101010101001111111111111at 32 bits
Rotated left by 111111111111100101010101000000101at 32 bits, wrapping
Shifted left by 1-11010101010111111100= -873,980, no wrap
Shifted right by 1-110101010101111111= -218,495, discarding the low bit
These bits as a double2.15901747 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-436,990 to the power 2190,960,260,100
-436,990 to the power 3-83,447,724,061,099,000
-436,990 to the power 436,465,820,937,459,652,010,000
-436,990 to the power 5-15,935,199,091,460,493,331,849,900,000
First ten multiples-436,990, -873,980, -1,310,970, -1,747,960, -2,184,950, -2,621,940, -3,058,930, -3,495,920, -3,932,910, -4,369,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 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 10
Divisible by 100No, remainder 90
As a percentage & fraction
As a percentage-43,699,000%
-436,990% as a decimal-4,369.9
-436,990% of 100-436,990
-436,990% of 1,000-4,369,900
As a fraction of 100-436,990/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -436,990
Nerdulate something else
Nothing in mind? Surprise me · today’s page