Nerdulator> put something in

Recognised as Number

-13,330,384

  • Negative
  • Even
  • 8 digits

-13,330,384 is an even 8-digit integer and the negative of 13,330,384. It has 40 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value13,330,384
Digit count8
Digit sum25
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 × 2^4 × 73 × 101 × 113
Distinct prime factors42, 73, 101, 113
Number of divisors40
Sum of divisors σ(n)26,674,632
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 73, 101, 113, 146, 202, 226, 292, 404, 452, 584, 808, 904, 1,168, 1,616, 1,808, 7,373, 8,249, 11,413, 14,746, 16,498, 22,826, 29,492, 32,996, 45,652, 58,984, 65,992, 91,304, 117,968, 131,984, 182,608, 833,149, 1,666,298, 3,332,596, 6,665,192, 13,330,38440 in total

Arithmetic

Previous number-13,330,385
Next number-13,330,383
Cube-2,368,797,740,509,622,063,104
Cube root-237.108734903
Negation13,330,384
Reciprocal-7.50165937 × 10^-8

Representations

Decimal-13,330,384
Binary11001011011001111101000024 bits
Octal62663720
HexadecimalCB67D0
Base 367XPSG
In wordsminus thirteen million, three hundred and thirty thousand, three hundred and eighty-four
Ordinalminus thirteen million, three hundred and thirty thousand, three hundred and eighty-fourth
Scientific notation-1.3330384 × 10^7
Engineering notation-13.330384 × 10^6

In other bases

Ternary221002020211221base 3; the most digit-efficient integer base after e: 15 digits
Quinary11403033014base 5; one hand: 11 digits
Septenary221210044base 7: 9 digits
Nonary27066757base 9; each digit is two ternary digits: 8 digits
Duodecimal456a414base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4365j4base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:1:42:53:4base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T0T1T1T01101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101011110100001110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111001101001001100000110000
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes3cb 67 d0
Gray code101011101101010000111000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001101001001100000110000two's complement
64-bit1111111111111111111111111111111111111111001101001001100000110000two's complement
One's complement00000000110010110110011111001111at 32 bits, every bit flipped
Bits reversed00001100000110010010110011111111at 32 bits
Rotated left by 111111110011010010011000001100001at 32 bits, wrapping
Shifted left by 1-1100101101100111110100000= -26,660,768, no wrap
Shifted right by 1-11001011011001111101000= -6,665,192, discarding the low bit
These bits as a double6.58608478 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+13,330,386
Nearest square below13,329,801
Nearest square above13,337,104

Powers & multiples

-13,330,384 to the power 2177,699,137,587,456
-13,330,384 to the power 3-2,368,797,740,509,622,063,104
-13,330,384 to the power 431,576,983,499,325,617,796,048,551,936
-13,330,384 to the power 5-420,933,315,607,674,226,258,560,879,950,823,424
First ten multiples-13,330,384, -26,660,768, -39,991,152, -53,321,536, -66,651,920, -79,982,304, -93,312,688, -106,643,072, -119,973,456, -133,303,840
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 4
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 84

As a percentage & fraction

As a percentage-1,333,038,400%
-13,330,384% as a decimal-133,303.84
-13,330,384% of 100-13,330,384
-13,330,384% of 1,000-133,303,840
As a fraction of 100-13,330,384/100

Keep nerding

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

Also reads as

13330384 (identifier)

  • 8 characters
  • Checksum fails

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