Nerdulator> put something in

Recognised as Number

-10,040,163

  • Negative
  • Odd
  • 8 digits

-10,040,163 is an odd 8-digit integer and the negative of 10,040,163. It has 16 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value10,040,163
Digit count8
Digit sum15
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3 × 7 × 113 × 4,231
Distinct prime factors43, 7, 113, 4,231
Number of divisors16
Sum of divisors σ(n)15,438,336
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 113, 339, 791, 2,373, 4,231, 12,693, 29,617, 88,851, 478,103, 1,434,309, 3,346,721, 10,040,16316 in total

Arithmetic

Previous number-10,040,164
Next number-10,040,162
Cube-1,012,097,356,782,662,610,747
Cube root-215.731512259
Negation10,040,163
Reciprocal-9.95999766 × 10^-8

Representations

Decimal-10,040,163
Binary10011001001100110110001124 bits
Octal46231543
Hexadecimal993363
Base 365Z71F
In wordsminus ten million, forty thousand, one hundred and sixty-three
Ordinalminus ten million, forty thousand, one hundred and sixty-third
Scientific notation-1.0040163 × 10^7
Engineering notation-10.040163 × 10^6

In other bases

Ternary200220002111220base 3; the most digit-efficient integer base after e: 15 digits
Quinary10032241123base 5; one hand: 11 digits
Septenary151224420base 7: 9 digits
Nonary20802456base 9; each digit is two ternary digits: 8 digits
Duodecimal3442343base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32f083base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:28:56:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T0100T0111010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110111101110111101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111011001101100110010011101
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 33 63
Gray code110101011010101011010010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011001101100110010011101two's complement
64-bit1111111111111111111111111111111111111111011001101100110010011101two's complement
One's complement00000000100110010011001101100010at 32 bits, every bit flipped
Bits reversed10111001001100110110011011111111at 32 bits
Rotated left by 111111110110011011001100100111011at 32 bits, wrapping
Shifted left by 1-1001100100110011011000110= -20,080,326, no wrap
Shifted right by 1-10011001001100110110010= -5,020,081, discarding the low bit
These bits as a double4.96049962 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+10,040,165
Nearest square below10,036,224
Nearest square above10,042,561

Powers & multiples

-10,040,163 to the power 2100,804,873,066,569
-10,040,163 to the power 3-1,012,097,356,782,662,610,747
-10,040,163 to the power 410,161,622,433,967,088,185,905,431,761
-10,040,163 to the power 5-102,024,345,581,486,302,021,864,837,465,817,043
First ten multiples-10,040,163, -20,080,326, -30,120,489, -40,160,652, -50,200,815, -60,240,978, -70,281,141, -80,321,304, -90,361,467, -100,401,630
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 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 3
Divisible by 100No, remainder 63

As a percentage & fraction

As a percentage-1,004,016,300%
-10,040,163% as a decimal-100,401.63
-10,040,163% of 100-10,040,163
-10,040,163% of 1,000-100,401,630
As a fraction of 100-10,040,163/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Also reads as

10040163 (identifier)

  • 8 characters
  • Checksum fails

10040163 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.

Open this reading on its own page →

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

Every value on this page was computed from “-10040163” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.