Recognised as Number
-11,449
- Negative
- Odd
- Perfect square
- 5 digits
-11,449 is an odd 5-digit integer and the negative of 11,449. It has 3 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value11,449
Digit count5
Digit sum19
Digit product144
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 107²
Factors & divisors
Prime factorisation−1 × 107^2
Distinct prime factors1107
Number of divisors3
Sum of divisors σ(n)11,557
SquarefreeNohas a repeated prime factor
All divisors1, 107, 11,4493 in total
Arithmetic
Representations
Decimal-11,449
Binary1011001011100114 bits
Octal26271
Hexadecimal2CB9
Base 368U1
In wordsminus eleven thousand, four hundred and forty-nine
Ordinalminus eleven thousand, four hundred and forty-ninth
Scientific notation-1.1449 × 10^4
Engineering notation-11.449 × 10^3
In other bases
Ternary120201001base 3; the most digit-efficient integer base after e: 9 digits
Quinary331244base 5; one hand: 6 digits
Septenary45244base 7: 5 digits
Nonary16631base 9; each digit is two ternary digits: 5 digits
Duodecimal6761base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal18c9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal3:10:49base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T10T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1101001101000111
Bit length14 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits6within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 13worth 8,192
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes22c b9
Gray code11101011100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1101001101000111two's complement
32-bit11111111111111111101001101000111two's complement
64-bit1111111111111111111111111111111111111111111111111101001101000111two's complement
One's complement0010110010111000at 16 bits, every bit flipped
Bits reversed1110001011001011at 16 bits
Rotated left by 11010011010001111at 16 bits, wrapping
Shifted left by 1-101100101110010= -22,898, no wrap
Shifted right by 1-1011001011101= -5,724, discarding the low bit
These bits as a double5.65655758 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-11,449 to the power 2131,079,601
-11,449 to the power 3-1,500,730,351,849
-11,449 to the power 417,181,861,798,319,201
-11,449 to the power 5-196,715,135,728,956,532,249
First ten multiples-11,449, -22,898, -34,347, -45,796, -57,245, -68,694, -80,143, -91,592, -103,041, -114,490
Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
As a percentage & fraction
As a percentage-1,144,900%
-11,449% as a decimal-114.49
-11,449% of 100-11,449
-11,449% of 1,000-114,490
As a fraction of 100-11,449/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -11,449
Nerdulate something else
Nothing in mind? Surprise me · today’s page