Nerdulator> put something in

Recognised as Number

-10,040,161

  • Negative
  • Odd
  • 8 digits

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

Number properties

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

Factors & divisors

Prime factorisation−1 × 53 × 189,437
Distinct prime factors253, 189,437
Number of divisors4
Sum of divisors σ(n)10,229,652
SquarefreeYesno repeated prime factor
All divisors1, 53, 189,437, 10,040,1614 in total

Arithmetic

Previous number-10,040,162
Next number-10,040,160
Cube-1,012,096,751,953,544,693,281
Cube root-215.731497934
Negation10,040,161
Reciprocal-9.95999965 × 10^-8

Representations

Decimal-10,040,161
Binary10011001001100110110000124 bits
Octal46231541
Hexadecimal993361
Base 365Z71D
In wordsminus ten million, forty thousand, one hundred and sixty-one
Ordinalminus ten million, forty thousand, one hundred and sixty-first
Scientific notation-1.0040161 × 10^7
Engineering notation-10.040161 × 10^6

In other bases

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

Bit-level

11111111011001101100110010011111
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
Bytes399 33 61
Gray code110101011010101011010001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011001101100110010011111two's complement
64-bit1111111111111111111111111111111111111111011001101100110010011111two's complement
One's complement00000000100110010011001101100000at 32 bits, every bit flipped
Bits reversed11111001001100110110011011111111at 32 bits
Rotated left by 111111110110011011001100100111111at 32 bits, wrapping
Shifted left by 1-1001100100110011011000010= -20,080,322, no wrap
Shifted right by 1-10011001001100110110001= -5,020,080, discarding the low bit
These bits as a double4.96049863 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

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

Powers & multiples

-10,040,161 to the power 2100,804,832,905,921
-10,040,161 to the power 3-1,012,096,751,953,544,693,281
-10,040,161 to the power 410,161,614,337,190,653,241,236,858,241
-10,040,161 to the power 5-102,024,243,965,302,446,237,189,895,873,816,801
First ten multiples-10,040,161, -20,080,322, -30,120,483, -40,160,644, -50,200,805, -60,240,966, -70,281,127, -80,321,288, -90,361,449, -100,401,610
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61

As a percentage & fraction

As a percentage-1,004,016,100%
-10,040,161% as a decimal-100,401.61
-10,040,161% of 100-10,040,161
-10,040,161% of 1,000-100,401,610
As a fraction of 100-10,040,161/100

Keep nerding

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

Also reads as

10040161 (identifier)

  • 8 characters
  • Checksum valid

10040161 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for ISSN. 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 validmod 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 “-10040161” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.