Nerdulator> put something in

Recognised as Number

-13,290,662

  • Negative
  • Even
  • 8 digits

-13,290,662 is an even 8-digit integer and the negative of 13,290,662. It has 24 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value13,290,662
Digit count8
Digit sum29
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 × 7^2 × 11 × 12,329
Distinct prime factors42, 7, 11, 12,329
Number of divisors24
Sum of divisors σ(n)25,301,160
SquarefreeNohas a repeated prime factor
All divisors1, 2, 7, 11, 14, 22, 49, 77, 98, 154, 539, 1,078, 12,329, 24,658, 86,303, 135,619, 172,606, 271,238, 604,121, 949,333, 1,208,242, 1,898,666, 6,645,331, 13,290,66224 in total

Arithmetic

Previous number-13,290,663
Next number-13,290,661
Cube-2,347,685,081,935,678,397,528
Cube root-236.872987663
Negation13,290,662
Reciprocal-7.52407969 × 10^-8

Representations

Decimal-13,290,662
Binary11001010110011001010011024 bits
Octal62546246
HexadecimalCACCA6
Base 367WV52
In wordsminus thirteen million, two hundred and ninety thousand, six hundred and sixty-two
Ordinalminus thirteen million, two hundred and ninety thousand, six hundred and sixty-second
Scientific notation-1.3290662 × 10^7
Engineering notation-13.290662 × 10^6

In other bases

Ternary221000020100202base 3; the most digit-efficient integer base after e: 15 digits
Quinary11400300122base 5; one hand: 11 digits
Septenary220653200base 7: 9 digits
Nonary27006322base 9; each digit is two ternary digits: 8 digits
Duodecimal454b432base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4316d2base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:1:31:51:2base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T000T10T0T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101010111010010101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001101010011001101011010
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
Bytes3ca cc a6
Gray code101011111010101011110101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001101010011001101011010two's complement
64-bit1111111111111111111111111111111111111111001101010011001101011010two's complement
One's complement00000000110010101100110010100101at 32 bits, every bit flipped
Bits reversed01011010110011001010110011111111at 32 bits
Rotated left by 111111110011010100110011010110101at 32 bits, wrapping
Shifted left by 1-1100101011001100101001100= -26,581,324, no wrap
Shifted right by 1-11001010110011001010011= -6,645,331, discarding the low bit
These bits as a double6.5664595 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+13,290,664
Nearest square below13,286,025
Nearest square above13,293,316

Powers & multiples

-13,290,662 to the power 2176,641,696,398,244
-13,290,662 to the power 3-2,347,685,081,935,678,397,528
-13,290,662 to the power 431,202,288,906,449,407,322,246,283,536
-13,290,662 to the power 5-414,699,075,481,968,692,820,300,435,233,140,832
First ten multiples-13,290,662, -26,581,324, -39,871,986, -53,162,648, -66,453,310, -79,743,972, -93,034,634, -106,325,296, -119,615,958, -132,906,620
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 2
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62

As a percentage & fraction

As a percentage-1,329,066,200%
-13,290,662% as a decimal-132,906.62
-13,290,662% of 100-13,290,662
-13,290,662% of 1,000-132,906,620
As a fraction of 100-13,290,662/100

Keep nerding

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

Also reads as

13290662 (identifier)

  • 8 characters
  • Checksum fails

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