Nerdulator> put something in

Recognised as Number

-13,329,152

  • Negative
  • Even
  • 8 digits

-13,329,152 is an even 8-digit integer and the negative of 13,329,152. It has 18 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value13,329,152
Digit count8
Digit sum26
Digit product1,620
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2^8 × 52,067
Distinct prime factors22, 52,067
Number of divisors18
Sum of divisors σ(n)26,606,748
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 52,067, 104,134, 208,268, 416,536, 833,072, 1,666,144, 3,332,288, 6,664,576, 13,329,15218 in total

Arithmetic

Previous number-13,329,153
Next number-13,329,151
Cube-2,368,141,025,194,759,159,808
Cube root-237.101430114
Negation13,329,152
Reciprocal-7.50235274 × 10^-8

Representations

Decimal-13,329,152
Binary11001011011000110000000024 bits
Octal62661400
HexadecimalCB6300
Base 367XOU8
In wordsminus thirteen million, three hundred and twenty-nine thousand, one hundred and fifty-two
Ordinalminus thirteen million, three hundred and twenty-nine thousand, one hundred and fifty-second
Scientific notation-1.3329152 × 10^7
Engineering notation-13.329152 × 10^6

In other bases

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

Bit-level

11111111001101001001110100000000
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 88 trailing zeros
Power of twoNo
Bytes3cb 63 00
Gray code101011101101001010000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001101001001110100000000two's complement
64-bit1111111111111111111111111111111111111111001101001001110100000000two's complement
One's complement00000000110010110110001011111111at 32 bits, every bit flipped
Bits reversed00000000101110010010110011111111at 32 bits
Rotated left by 111111110011010010011101000000001at 32 bits, wrapping
Shifted left by 1-1100101101100011000000000= -26,658,304, no wrap
Shifted right by 1-11001011011000110000000= -6,664,576, discarding the low bit
These bits as a double6.58547609 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+13,329,154
Nearest square below13,322,500
Nearest square above13,329,801

Powers & multiples

-13,329,152 to the power 2177,666,293,039,104
-13,329,152 to the power 3-2,368,141,025,194,759,159,808
-13,329,152 to the power 431,565,311,682,256,774,444,473,122,816
-13,329,152 to the power 5-420,738,837,340,176,249,600,097,813,929,132,032
First ten multiples-13,329,152, -26,658,304, -39,987,456, -53,316,608, -66,645,760, -79,974,912, -93,304,064, -106,633,216, -119,962,368, -133,291,520
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 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 8
Divisible by 100No, remainder 52

As a percentage & fraction

As a percentage-1,332,915,200%
-13,329,152% as a decimal-133,291.52
-13,329,152% of 100-13,329,152
-13,329,152% of 1,000-133,291,520
As a fraction of 100-13,329,152/100

Keep nerding

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

Also reads as

13329152 (identifier)

  • 8 characters
  • Checksum fails

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