Recognised as Number
-11,189,367
- Negative
- Odd
- 8 digits
-11,189,367 is an odd 8-digit integer and the negative of 11,189,367. It has 32 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value11,189,367
Digit count8
Digit sum36
Digit product9,072
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^3 × 7 × 73 × 811
Distinct prime factors43, 7, 73, 811
Number of divisors32
Sum of divisors σ(n)19,228,160
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 27, 63, 73, 189, 219, 511, 657, 811, 1,533, 1,971, 2,433, 4,599, 5,677, 7,299, 13,797, 17,031, 21,897, 51,093, 59,203, 153,279, 177,609, 414,421, 532,827, 1,243,263, 1,598,481, 3,729,789, 11,189,36732 in total
Arithmetic
Previous number-11,189,368
Next number-11,189,366
Double-22,378,734
Half-5,594,683.5
Square125,201,933,860,689
Cube-1,400,930,387,076,976,093,863
Cube root-223.66696231≈
Negation11,189,367
Reciprocal-8.93705605 × 10^-8≈
Representations
Decimal-11,189,367
Binary10101010101111000111011124 bits
Octal52536167
HexadecimalAABC77
Base 366NTRR
In wordsminus eleven million, one hundred and eighty-nine thousand, three hundred and sixty-seven
Ordinalminus eleven million, one hundred and eighty-nine thousand, three hundred and sixty-seventh
Scientific notation-1.1189367 × 10^7
Engineering notation-11.189367 × 10^6
In other bases
Ternary210001110221000base 3; the most digit-efficient integer base after e: 15 digits
Quinary10331024432base 5; one hand: 11 digits
Septenary164052030base 7: 9 digits
Nonary23043830base 9; each digit is two ternary digits: 8 digits
Duodecimal38b73b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal39id87base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal51:48:9:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T000TTTT01T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101010100010010011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111010101010100001110001001
Bit length24 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits9within that length
Bit parityodd15 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
Bytes3aa bc 77
Gray code111111111110001001001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111010101010100001110001001two's complement
64-bit1111111111111111111111111111111111111111010101010100001110001001two's complement
One's complement00000000101010101011110001110110at 32 bits, every bit flipped
Bits reversed10010001110000101010101011111111at 32 bits
Rotated left by 111111110101010101000011100010011at 32 bits, wrapping
Shifted left by 1-1010101010111100011101110= -22,378,734, no wrap
Shifted right by 1-10101010101111000111100= -5,594,683, discarding the low bit
These bits as a double5.52828183 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-11,189,367 to the power 2125,201,933,860,689
-11,189,367 to the power 3-1,400,930,387,076,976,093,863
-11,189,367 to the power 415,675,524,242,456,342,764,459,554,721
-11,189,367 to the power 5-175,399,193,666,241,000,669,332,514,429,851,607
First ten multiples-11,189,367, -22,378,734, -33,568,101, -44,757,468, -55,946,835, -67,136,202, -78,325,569, -89,514,936, -100,704,303, -111,893,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-1,118,936,700%
-11,189,367% as a decimal-111,893.67
-11,189,367% of 100-11,189,367
-11,189,367% of 1,000-111,893,670
As a fraction of 100-11,189,367/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,189,367
Also reads as
11189367 (identifier)
- 8 characters
- Checksum valid
11189367 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for GTIN-8 (EAN-8). 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 validGS1 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