Recognised as Number
-449,966
- Negative
- Even
- 6 digits
-449,966 is an even 6-digit integer and the negative of 449,966. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value449,966
Digit count6
Digit sum38
Digit product46,656
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 11 × 113 × 181
Distinct prime factors42, 11, 113, 181
Number of divisors16
Sum of divisors σ(n)746,928
SquarefreeYesno repeated prime factor
All divisors1, 2, 11, 22, 113, 181, 226, 362, 1,243, 1,991, 2,486, 3,982, 20,453, 40,906, 224,983, 449,96616 in total
Arithmetic
Representations
Decimal-449,966
Binary110110111011010111019 bits
Octal1556656
Hexadecimal6DDAE
Base 369N72
In wordsminus four hundred and forty-nine thousand, nine hundred and sixty-six
Ordinalminus four hundred and forty-nine thousand, nine hundred and sixty-sixth
Scientific notation-4.49966 × 10^5
Engineering notation-449.966 × 10^3
In other bases
Ternary211212020102base 3; the most digit-efficient integer base after e: 12 digits
Quinary103344331base 5; one hand: 9 digits
Septenary3552566base 7: 7 digits
Nonary755212base 9; each digit is two ternary digits: 6 digits
Duodecimal198492base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2g4i6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal2:4:59:26base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT011011T10TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110011001010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110010010001001010010
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 dd ae
Gray code1011011001101111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110010010001001010010two's complement
64-bit1111111111111111111111111111111111111111111110010010001001010010two's complement
One's complement00000000000001101101110110101101at 32 bits, every bit flipped
Bits reversed01001010010001001001111111111111at 32 bits
Rotated left by 111111111111100100100010010100101at 32 bits, wrapping
Shifted left by 1-11011011101101011100= -899,932, no wrap
Shifted right by 1-110110111011010111= -224,983, discarding the low bit
These bits as a double2.22312742 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-449,966 to the power 2202,469,401,156
-449,966 to the power 3-91,104,346,560,560,696
-449,966 to the power 440,993,858,404,469,254,136,336
-449,966 to the power 5-18,445,842,490,825,412,406,710,564,576
First ten multiples-449,966, -899,932, -1,349,898, -1,799,864, -2,249,830, -2,699,796, -3,149,762, -3,599,728, -4,049,694, -4,499,660
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 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11Yes
Divisible by 12No, remainder 2
Divisible by 100No, remainder 66
As a percentage & fraction
As a percentage-44,996,600%
-449,966% as a decimal-4,499.66
-449,966% of 100-449,966
-449,966% of 1,000-4,499,660
As a fraction of 100-449,966/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -449,966
Nerdulate something else
Nothing in mind? Surprise me · today’s page