Nerdulator> put something in

Recognised as Number

-10,048,387

  • Negative
  • Odd
  • 8 digits

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

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value10,048,387
Digit count8
Digit sum31
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 × 10,048,387
Distinct prime factors110,048,387
Number of divisors2
Sum of divisors σ(n)10,048,388
SquarefreeYesno repeated prime factor
All divisors1, 10,048,3872 in total

Arithmetic

Previous number-10,048,388
Next number-10,048,386
Cube-1,014,586,452,341,638,696,603
Cube root-215.790398811≈
Negation10,048,387
Reciprocal-9.951846 × 10^-8≈

Representations

Decimal-10,048,387
Binary10011001010100111000001124 bits
Octal46251603
Hexadecimal995383
Base 365ZDDV
In wordsminus ten million, forty-eight thousand, three hundred and eighty-seven
Ordinalminus ten million, forty-eight thousand, three hundred and eighty-seventh
Scientific notation-1.0048387 × 10^7
Engineering notation-10.048387 × 10^6

In other bases

Ternary200220111210111base 3; the most digit-efficient integer base after e: 15 digits
Quinary10033022022base 5; one hand: 11 digits
Septenary151260406base 7: 9 digits
Nonary20814714base 9; each digit is two ternary digits: 8 digits
Duodecimal3447057base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32g0j7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:31:13:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T01T1111T0TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110111111110110001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111011001101010110001111101
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 53 83
Gray code110101011111101001000010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011001101010110001111101two's complement
64-bit1111111111111111111111111111111111111111011001101010110001111101two's complement
One's complement00000000100110010101001110000010at 32 bits, every bit flipped
Bits reversed10111110001101010110011011111111at 32 bits
Rotated left by 111111110110011010101100011111011at 32 bits, wrapping
Shifted left by 1-1001100101010011100000110= -20,096,774, no wrap
Shifted right by 1-10011001010100111000010= -5,024,193, discarding the low bit
These bits as a double4.96456281 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+10,048,389
Nearest square below10,042,561
Nearest square above10,048,900

Powers & multiples

-10,048,387 to the power 2100,970,081,301,769
-10,048,387 to the power 3-1,014,586,452,341,638,696,603
-10,048,387 to the power 410,194,957,318,085,841,837,642,529,361
-10,048,387 to the power 5-102,442,876,580,608,638,005,423,302,678,190,707
First ten multiples-10,048,387, -20,096,774, -30,145,161, -40,193,548, -50,241,935, -60,290,322, -70,338,709, -80,387,096, -90,435,483, -100,483,870
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87

As a percentage & fraction

As a percentage-1,004,838,700%
-10,048,387% as a decimal-100,483.87
-10,048,387% of 100-10,048,387
-10,048,387% of 1,000-100,483,870
As a fraction of 100-10,048,387/100

Keep nerding

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

Also reads as

10048387 (identifier)

  • 8 characters
  • Checksum valid

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