Recognised as Number
-11,049,321
- Negative
- Odd
- 8 digits
-11,049,321 is an odd 8-digit integer and the negative of 11,049,321. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value11,049,321
Digit count8
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 3,683,107
Distinct prime factors23, 3,683,107
Number of divisors4
Sum of divisors σ(n)14,732,432
SquarefreeYesno repeated prime factor
All divisors1, 3, 3,683,107, 11,049,3214 in total
Arithmetic
Previous number-11,049,322
Next number-11,049,320
Double-22,098,642
Half-5,524,660.5
Square122,087,494,561,041
Cube-1,348,983,917,490,696,103,161
Cube root-222.729904181≈
Negation11,049,321
Reciprocal-9.05032988 × 10^-8≈
Representations
Decimal-11,049,321
Binary10101000100110010110100124 bits
Octal52114551
HexadecimalA89969
Base 366KTPL
In wordsminus eleven million, forty-nine thousand, three hundred and twenty-one
Ordinalminus eleven million, forty-nine thousand, three hundred and twenty-first
Scientific notation-1.1049321 × 10^7
Engineering notation-11.049321 × 10^6
In other bases
Ternary202210100211010base 3; the most digit-efficient integer base after e: 15 digits
Quinary10312034241base 5; one hand: 11 digits
Septenary162626523base 7: 9 digits
Nonary22710733base 9; each digit is two ternary digits: 8 digits
Duodecimal384a349base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal391361base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal51:9:15:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T01T0T0T1TT0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010001011101111101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111010101110110011010010111
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes3a8 99 69
Gray code111111001101010111011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111010101110110011010010111two's complement
64-bit1111111111111111111111111111111111111111010101110110011010010111two's complement
One's complement00000000101010001001100101101000at 32 bits, every bit flipped
Bits reversed11101001011001101110101011111111at 32 bits
Rotated left by 111111110101011101100110100101111at 32 bits, wrapping
Shifted left by 1-1010100010011001011010010= -22,098,642, no wrap
Shifted right by 1-10101000100110010110101= -5,524,660, discarding the low bit
These bits as a double5.45908992 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-11,049,321 to the power 2122,087,494,561,041
-11,049,321 to the power 3-1,348,983,917,490,696,103,161
-11,049,321 to the power 414,905,356,328,192,215,757,275,003,681
-11,049,321 to the power 5-164,694,066,689,577,141,603,389,600,947,550,601
First ten multiples-11,049,321, -22,098,642, -33,147,963, -44,197,284, -55,246,605, -66,295,926, -77,345,247, -88,394,568, -99,443,889, -110,493,210
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-1,104,932,100%
-11,049,321% as a decimal-110,493.21
-11,049,321% of 100-11,049,321
-11,049,321% of 1,000-110,493,210
As a fraction of 100-11,049,321/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -11,049,321
Also reads as
11049321 (identifier)
- 8 characters
- Checksum fails
11049321 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page