Nerdulator> put something in

Recognised as Number

-10,004,119

  • Negative
  • Odd
  • 8 digits

-10,004,119 is an odd 8-digit integer and the negative of 10,004,119. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value10,004,119
Digit count8
Digit sum16
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,004,119
Distinct prime factors110,004,119
Number of divisors2
Sum of divisors σ(n)10,004,120
SquarefreeYesno repeated prime factor
All divisors1, 10,004,1192 in total

Arithmetic

Previous number-10,004,120
Next number-10,004,118
Cube-1,001,236,209,054,713,617,159
Cube root-215.473045331
Negation10,004,119
Reciprocal-9.9958827 × 10^-8

Representations

Decimal-10,004,119
Binary10011000101001101001011124 bits
Octal46123227
Hexadecimal98A697
Base 365YF87
In wordsminus ten million, four thousand, one hundred and nineteen
Ordinalminus ten million, four thousand, one hundred and nineteenth
Scientific notation-1.0004119 × 10^7
Engineering notation-10.004119 × 10^6

In other bases

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

Bit-level

11111111011001110101100101101001
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
Bytes398 a6 97
Gray code110101001111010111011100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011001110101100101101001two's complement
64-bit1111111111111111111111111111111111111111011001110101100101101001two's complement
One's complement00000000100110001010011010010110at 32 bits, every bit flipped
Bits reversed10010110100110101110011011111111at 32 bits
Rotated left by 111111110110011101011001011010011at 32 bits, wrapping
Shifted left by 1-1001100010100110100101110= -20,008,238, no wrap
Shifted right by 1-10011000101001101001100= -5,002,059, discarding the low bit
These bits as a double4.94269151 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

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

Powers & multiples

-10,004,119 to the power 2100,082,396,966,161
-10,004,119 to the power 3-1,001,236,209,054,713,617,159
-10,004,119 to the power 410,016,486,182,492,232,536,979,077,921
-10,004,119 to the power 5-100,206,119,731,508,010,875,610,596,031,956,599
First ten multiples-10,004,119, -20,008,238, -30,012,357, -40,016,476, -50,020,595, -60,024,714, -70,028,833, -80,032,952, -90,037,071, -100,041,190
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 19

As a percentage & fraction

As a percentage-1,000,411,900%
-10,004,119% as a decimal-100,041.19
-10,004,119% of 100-10,004,119
-10,004,119% of 1,000-100,041,190
As a fraction of 100-10,004,119/100

Keep nerding

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

Also reads as

10004119 (identifier)

  • 8 characters
  • Checksum fails

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