Nerdulator> put something in

Recognised as Number

-11,296,321

  • Negative
  • Odd
  • Perfect square
  • 8 digits

-11,296,321 is an odd 8-digit integer and the negative of 11,296,321. It has 3 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value11,296,321
Digit count8
Digit sum25
Digit product648
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 3,361²

Factors & divisors

Prime factorisation−1 × 3,361^2
Distinct prime factors13,361
Number of divisors3
Sum of divisors σ(n)11,299,683
SquarefreeNohas a repeated prime factor
All divisors1, 3,361, 11,296,3213 in total

Arithmetic

Previous number-11,296,322
Next number-11,296,320
Cube-1,441,488,144,258,094,484,161
Cube root-224.377346804
Negation11,296,321
Reciprocal-8.85243966 × 10^-8

Representations

Decimal-11,296,321
Binary10101100010111100100000124 bits
Octal53057101
HexadecimalAC5E41
Base 366Q4AP
In wordsminus eleven million, two hundred and ninety-six thousand, three hundred and twenty-one
Ordinalminus eleven million, two hundred and ninety-six thousand, three hundred and twenty-first
Scientific notation-1.1296321 × 10^7
Engineering notation-11.296321 × 10^6

In other bases

Ternary210020220122021base 3; the most digit-efficient integer base after e: 15 digits
Quinary10342440241base 5; one hand: 11 digits
Septenary165005611base 7: 9 digits
Nonary23226567base 9; each digit is two ternary digits: 8 digits
Duodecimal3949281base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal3ac0g1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal52:17:52:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T0T1T01T101T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101001110011011000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111010100111010000110111111
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
Bytes3ac 5e 41
Gray code111110100111000101100001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111010100111010000110111111two's complement
64-bit1111111111111111111111111111111111111111010100111010000110111111two's complement
One's complement00000000101011000101111001000000at 32 bits, every bit flipped
Bits reversed11111101100001011100101011111111at 32 bits
Rotated left by 111111110101001110100001101111111at 32 bits, wrapping
Shifted left by 1-1010110001011110010000010= -22,592,642, no wrap
Shifted right by 1-10101100010111100100001= -5,648,160, discarding the low bit
These bits as a double5.58112413 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+11,296,323
Nearest square below11,296,321
Nearest square above11,303,044

Powers & multiples

-11,296,321 to the power 2127,606,868,135,041
-11,296,321 to the power 3-1,441,488,144,258,094,484,161
-11,296,321 to the power 416,283,512,795,233,742,141,412,071,681
-11,296,321 to the power 5-183,943,787,542,567,621,260,618,154,983,585,601
First ten multiples-11,296,321, -22,592,642, -33,888,963, -45,185,284, -56,481,605, -67,777,926, -79,074,247, -90,370,568, -101,666,889, -112,963,210
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21

As a percentage & fraction

As a percentage-1,129,632,100%
-11,296,321% as a decimal-112,963.21
-11,296,321% of 100-11,296,321
-11,296,321% of 1,000-112,963,210
As a fraction of 100-11,296,321/100

Keep nerding

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

Also reads as

11296321 (identifier)

  • 8 characters
  • Checksum valid

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