Recognised as Number
-446,690
- Negative
- Even
- 6 digits
-446,690 is an even 6-digit integer and the negative of 446,690. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value446,690
Digit count6
Digit sum29
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 × 19 × 2,351
Distinct prime factors42, 5, 19, 2,351
Number of divisors16
Sum of divisors σ(n)846,720
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 19, 38, 95, 190, 2,351, 4,702, 11,755, 23,510, 44,669, 89,338, 223,345, 446,69016 in total
Arithmetic
Representations
Decimal-446,690
Binary110110100001110001019 bits
Octal1550342
Hexadecimal6D0E2
Base 369KO2
In wordsminus four hundred and forty-six thousand, six hundred and ninety
Ordinalminus four hundred and forty-six thousand, six hundred and ninetieth
Scientific notation-4.4669 × 10^5
Engineering notation-446.69 × 10^3
In other bases
Ternary211200202002base 3; the most digit-efficient integer base after e: 12 digits
Quinary103243230base 5; one hand: 9 digits
Septenary3540206base 7: 7 digits
Nonary750662base 9; each digit is two ternary digits: 6 digits
Duodecimal196602base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2fgeabase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal2:4:4:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT01110T1T10T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010111001101100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110010010111100011110
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 d0 e2
Gray code1011011100010010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110010010111100011110two's complement
64-bit1111111111111111111111111111111111111111111110010010111100011110two's complement
One's complement00000000000001101101000011100001at 32 bits, every bit flipped
Bits reversed01111000111101001001111111111111at 32 bits
Rotated left by 111111111111100100101111000111101at 32 bits, wrapping
Shifted left by 1-11011010000111000100= -893,380, no wrap
Shifted right by 1-110110100001110001= -223,345, discarding the low bit
These bits as a double2.20694183 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-446,690 to the power 2199,531,956,100
-446,690 to the power 3-89,128,929,470,309,000
-446,690 to the power 439,813,001,505,092,327,210,000
-446,690 to the power 5-17,784,069,642,309,691,641,434,900,000
First ten multiples-446,690, -893,380, -1,340,070, -1,786,760, -2,233,450, -2,680,140, -3,126,830, -3,573,520, -4,020,210, -4,466,900
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 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 2
Divisible by 100No, remainder 90
As a percentage & fraction
As a percentage-44,669,000%
-446,690% as a decimal-4,466.9
-446,690% of 100-446,690
-446,690% of 1,000-4,466,900
As a fraction of 100-446,690/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -446,690
Nerdulate something else
Nothing in mind? Surprise me · today’s page