Nerdulator> put something in

Recognised as Number

-10,004,150

  • Negative
  • Even
  • 8 digits

-10,004,150 is an even 8-digit integer and the negative of 10,004,150. It has 24 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value10,004,150
Digit count8
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 5^2 × 13 × 15,391
Distinct prime factors42, 5, 13, 15,391
Number of divisors24
Sum of divisors σ(n)20,040,384
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 13, 25, 26, 50, 65, 130, 325, 650, 15,391, 30,782, 76,955, 153,910, 200,083, 384,775, 400,166, 769,550, 1,000,415, 2,000,830, 5,002,075, 10,004,15024 in total

Arithmetic

Previous number-10,004,151
Next number-10,004,149
Cube-1,001,245,516,746,473,375,000
Cube root-215.473267895
Negation10,004,150
Reciprocal-9.99585172 × 10^-8

Representations

Decimal-10,004,150
Binary10011000101001101011011024 bits
Octal46123266
Hexadecimal98A6B6
Base 365YF92
In wordsminus ten million, four thousand, one hundred and fifty
Ordinalminus ten million, four thousand, one hundred and fiftieth
Scientific notation-1.000415 × 10^7
Engineering notation-10.00415 × 10^6

In other bases

Ternary200211021010002base 3; the most digit-efficient integer base after e: 15 digits
Quinary10030113100base 5; one hand: 11 digits
Septenary151014422base 7: 9 digits
Nonary20737102base 9; each digit is two ternary digits: 8 digits
Duodecimal3425532base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32aa7abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:18:55:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T1TTT1T0T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110001010100101011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111011001110101100101001010
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 even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes398 a6 b6
Gray code110101001111010111101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011001110101100101001010two's complement
64-bit1111111111111111111111111111111111111111011001110101100101001010two's complement
One's complement00000000100110001010011010110101at 32 bits, every bit flipped
Bits reversed01010010100110101110011011111111at 32 bits
Rotated left by 111111110110011101011001010010101at 32 bits, wrapping
Shifted left by 1-1001100010100110101101100= -20,008,300, no wrap
Shifted right by 1-10011000101001101011011= -5,002,075, discarding the low bit
These bits as a double4.94270683 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+10,004,152
Nearest square below9,998,244
Nearest square above10,004,569

Powers & multiples

-10,004,150 to the power 2100,083,017,222,500
-10,004,150 to the power 3-1,001,245,516,746,473,375,000
-10,004,150 to the power 410,016,610,336,359,231,614,506,250,000
-10,004,150 to the power 5-100,207,672,296,488,206,956,262,700,937,500,000
First ten multiples-10,004,150, -20,008,300, -30,012,450, -40,016,600, -50,020,750, -60,024,900, -70,029,050, -80,033,200, -90,037,350, -100,041,500
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 2
Divisible by 100No, remainder 50

As a percentage & fraction

As a percentage-1,000,415,000%
-10,004,150% as a decimal-100,041.5
-10,004,150% of 100-10,004,150
-10,004,150% of 1,000-100,041,500
As a fraction of 100-10,004,150/100

Keep nerding

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

Also reads as

10004150 (identifier)

  • 8 characters
  • Checksum fails

10004150 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 “-10004150” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.