Recognised as Number
-13,329,150
- Negative
- Even
- 8 digits
-13,329,150 is an even 8-digit integer and the negative of 13,329,150. It has 24 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value13,329,150
Digit count8
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3 × 5^2 × 88,861
Distinct prime factors42, 3, 5, 88,861
Number of divisors24
Sum of divisors σ(n)33,056,664
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 88,861, 177,722, 266,583, 444,305, 533,166, 888,610, 1,332,915, 2,221,525, 2,665,830, 4,443,050, 6,664,575, 13,329,15024 in total
Arithmetic
Previous number-13,329,151
Next number-13,329,149
Double-26,658,300
Half-6,664,575
Square177,666,239,722,500
Cube-2,368,139,959,197,160,875,000
Cube root-237.101418255≈
Negation13,329,150
Reciprocal-7.50235386 × 10^-8≈
Representations
Decimal-13,329,150
Binary11001011011000101111111024 bits
Octal62661376
HexadecimalCB62FE
Base 367XOU6
In wordsminus thirteen million, three hundred and twenty-nine thousand, one hundred and fifty
Ordinalminus thirteen million, three hundred and twenty-nine thousand, one hundred and fiftieth
Scientific notation-1.332915 × 10^7
Engineering notation-13.32915 × 10^6
In other bases
Ternary221002012011020base 3; the most digit-efficient integer base after e: 15 digits
Quinary11403013100base 5; one hand: 11 digits
Septenary221203332base 7: 9 digits
Nonary27065136base 9; each digit is two ternary digits: 8 digits
Duodecimal4569766base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4362habase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:1:42:32:30base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T0T1T110TTT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101011110110100000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001101001001110100000010
Bit length24 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits9within that length
Bit parityodd15 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
Bytes3cb 62 fe
Gray code101011101101001110000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001101001001110100000010two's complement
64-bit1111111111111111111111111111111111111111001101001001110100000010two's complement
One's complement00000000110010110110001011111101at 32 bits, every bit flipped
Bits reversed01000000101110010010110011111111at 32 bits
Rotated left by 111111110011010010011101000000101at 32 bits, wrapping
Shifted left by 1-1100101101100010111111100= -26,658,300, no wrap
Shifted right by 1-11001011011000101111111= -6,664,575, discarding the low bit
These bits as a double6.5854751 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,329,150 to the power 2177,666,239,722,500
-13,329,150 to the power 3-2,368,139,959,197,160,875,000
-13,329,150 to the power 431,565,292,737,132,836,877,006,250,000
-13,329,150 to the power 5-420,738,521,687,154,152,659,147,857,187,500,000
First ten multiples-13,329,150, -26,658,300, -39,987,450, -53,316,600, -66,645,750, -79,974,900, -93,304,050, -106,633,200, -119,962,350, -133,291,500
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 6
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 50
As a percentage & fraction
As a percentage-1,332,915,000%
-13,329,150% as a decimal-133,291.5
-13,329,150% of 100-13,329,150
-13,329,150% of 1,000-133,291,500
As a fraction of 100-13,329,150/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -13,329,150
Also reads as
13329150 (identifier)
- 8 characters
- Checksum valid
13329150 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for GTIN-8 (EAN-8). A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit validGS1 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