Nerdulator> put something in

Recognised as Number

-11,010,398

  • Negative
  • Even
  • 8 digits

-11,010,398 is an even 8-digit integer and the negative of 11,010,398. It has 24 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value11,010,398
Digit count8
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 7^2 × 283 × 397
Distinct prime factors42, 7, 283, 397
Number of divisors24
Sum of divisors σ(n)19,328,472
SquarefreeNohas a repeated prime factor
All divisors1, 2, 7, 14, 49, 98, 283, 397, 566, 794, 1,981, 2,779, 3,962, 5,558, 13,867, 19,453, 27,734, 38,906, 112,351, 224,702, 786,457, 1,572,914, 5,505,199, 11,010,39824 in total

Arithmetic

Previous number-11,010,399
Next number-11,010,397
Cube-1,334,778,043,031,547,164,792
Cube root-222.468062579
Negation11,010,398
Reciprocal-9.08232382 × 10^-8

Representations

Decimal-11,010,398
Binary10101000000000010101111024 bits
Octal52000536
HexadecimalA8015E
Base 366JZOE
In wordsminus eleven million, ten thousand, three hundred and ninety-eight
Ordinalminus eleven million, ten thousand, three hundred and ninety-eighth
Scientific notation-1.1010398 × 10^7
Engineering notation-11.010398 × 10^6

In other bases

Ternary202201101102112base 3; the most digit-efficient integer base after e: 15 digits
Quinary10304313043base 5; one hand: 11 digits
Septenary162405200base 7: 9 digits
Nonary22641375base 9; each digit is two ternary digits: 8 digits
Duodecimal382b912base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal38g5jibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal50:58:26:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T010TT0TTT0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010000000001111100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111010101111111111010100010
Bit length24 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits15within that length
Bit parityodd9 set bits, so odd; 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
Bytes3a8 01 5e
Gray code111111000000000111110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111010101111111111010100010two's complement
64-bit1111111111111111111111111111111111111111010101111111111010100010two's complement
One's complement00000000101010000000000101011101at 32 bits, every bit flipped
Bits reversed01000101011111111110101011111111at 32 bits
Rotated left by 111111110101011111111110101000101at 32 bits, wrapping
Shifted left by 1-1010100000000001010111100= -22,020,796, no wrap
Shifted right by 1-10101000000000010101111= -5,505,199, discarding the low bit
These bits as a double5.4398594 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+11,010,400
Nearest square below11,009,124
Nearest square above11,015,761

Powers & multiples

-11,010,398 to the power 2121,228,864,118,404
-11,010,398 to the power 3-1,334,778,043,031,547,164,792
-11,010,398 to the power 414,696,437,495,438,460,840,131,507,216
-11,010,398 to the power 5-161,813,626,006,900,638,357,262,266,788,031,968
First ten multiples-11,010,398, -22,020,796, -33,031,194, -44,041,592, -55,051,990, -66,062,388, -77,072,786, -88,083,184, -99,093,582, -110,103,980
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 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10No, remainder 8
Divisible by 11No, remainder 3
Divisible by 12No, remainder 2
Divisible by 100No, remainder 98

As a percentage & fraction

As a percentage-1,101,039,800%
-11,010,398% as a decimal-110,103.98
-11,010,398% of 100-11,010,398
-11,010,398% of 1,000-110,103,980
As a fraction of 100-11,010,398/100

Keep nerding

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

Also reads as

11010398 (identifier)

  • 8 characters
  • Checksum valid

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