Recognised as Number
-10,040,011
- Negative
- Odd
- 8 digits
-10,040,011 is an odd 8-digit integer and the negative of 10,040,011. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value10,040,011
Digit count8
Digit sum7
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 10,040,011
Distinct prime factors110,040,011
Number of divisors2
Sum of divisors σ(n)10,040,012
SquarefreeYesno repeated prime factor
All divisors1, 10,040,0112 in total
Arithmetic
Previous number-10,040,012
Next number-10,040,010
Double-20,080,022
Half-5,020,005.5
Square100,801,820,880,121
Cube-1,012,051,390,456,444,521,331
Cube root-215.730423586≈
Negation10,040,011
Reciprocal-9.96014845 × 10^-8≈
Representations
Decimal-10,040,011
Binary10011001001100101100101124 bits
Octal46231313
Hexadecimal9932CB
Base 365Z6X7
In wordsminus ten million, forty thousand and eleven
Ordinalminus ten million, forty thousand and eleventh
Scientific notation-1.0040011 × 10^7
Engineering notation-10.040011 × 10^6
In other bases
Ternary200220002022021base 3; the most digit-efficient integer base after e: 15 digits
Quinary10032240021base 5; one hand: 11 digits
Septenary151224112base 7: 9 digits
Nonary20802267base 9; each digit is two ternary digits: 8 digits
Duodecimal3442237base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32f00bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:28:53:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T0100T1T01T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110111101110101110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111011001101100110100110101
Bit length24 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits12within that length
Bit parityeven12 set bits, so even; 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
Bytes399 32 cb
Gray code110101011010101110101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111011001101100110100110101two's complement
64-bit1111111111111111111111111111111111111111011001101100110100110101two's complement
One's complement00000000100110010011001011001010at 32 bits, every bit flipped
Bits reversed10101100101100110110011011111111at 32 bits
Rotated left by 111111110110011011001101001101011at 32 bits, wrapping
Shifted left by 1-1001100100110010110010110= -20,080,022, no wrap
Shifted right by 1-10011001001100101100110= -5,020,005, discarding the low bit
These bits as a double4.96042452 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-10,040,011 to the power 2100,801,820,880,121
-10,040,011 to the power 3-1,012,051,390,456,444,521,331
-10,040,011 to the power 410,161,007,092,747,998,015,052,974,641
-10,040,011 to the power 5-102,016,622,982,267,920,299,110,030,978,361,051
First ten multiples-10,040,011, -20,080,022, -30,120,033, -40,160,044, -50,200,055, -60,240,066, -70,280,077, -80,320,088, -90,360,099, -100,400,110
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-1,004,001,100%
-10,040,011% as a decimal-100,400.11
-10,040,011% of 100-10,040,011
-10,040,011% of 1,000-100,400,110
As a fraction of 100-10,040,011/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -10,040,011
Also reads as
10040011 (identifier)
- 8 characters
- Checksum fails
10040011 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