Nerdulator> put something in

Recognised as Number

-13,188,059

  • Negative
  • Odd
  • 8 digits

-13,188,059 is an odd 8-digit integer and the negative of 13,188,059. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value13,188,059
Digit count8
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 47 × 280,597
Distinct prime factors247, 280,597
Number of divisors4
Sum of divisors σ(n)13,468,704
SquarefreeYesno repeated prime factor
All divisors1, 47, 280,597, 13,188,0594 in total

Arithmetic

Previous number-13,188,060
Next number-13,188,058
Cube-2,293,731,845,241,610,489,379
Cube root-236.2618646
Negation13,188,059
Reciprocal-7.58261697 × 10^-8

Representations

Decimal-13,188,059
Binary11001001001110111101101124 bits
Octal62235733
HexadecimalC93BDB
Base 367UNYZ
In wordsminus thirteen million, one hundred and eighty-eight thousand and fifty-nine
Ordinalminus thirteen million, one hundred and eighty-eight thousand and fifty-ninth
Scientific notation-1.3188059 × 10^7
Engineering notation-13.188059 × 10^6

In other bases

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

Bit-level

11111111001101101100010000100101
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 odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes3c9 3b db
Gray code101011011010011000110110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001101101100010000100101two's complement
64-bit1111111111111111111111111111111111111111001101101100010000100101two's complement
One's complement00000000110010010011101111011010at 32 bits, every bit flipped
Bits reversed10100100001000110110110011111111at 32 bits
Rotated left by 111111110011011011000100001001011at 32 bits, wrapping
Shifted left by 1-1100100100111011110110110= -26,376,118, no wrap
Shifted right by 1-11001001001110111101110= -6,594,029, discarding the low bit
These bits as a double6.51576689 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+13,188,061
Nearest square below13,184,161
Nearest square above13,191,424

Powers & multiples

-13,188,059 to the power 2173,924,900,187,481
-13,188,059 to the power 3-2,293,731,845,241,610,489,379
-13,188,059 to the power 430,249,870,905,225,228,388,949,125,361
-13,188,059 to the power 5-398,937,082,240,493,720,281,936,013,259,264,299
First ten multiples-13,188,059, -26,376,118, -39,564,177, -52,752,236, -65,940,295, -79,128,354, -92,316,413, -105,504,472, -118,692,531, -131,880,590
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59

As a percentage & fraction

As a percentage-1,318,805,900%
-13,188,059% as a decimal-131,880.59
-13,188,059% of 100-13,188,059
-13,188,059% of 1,000-131,880,590
As a fraction of 100-13,188,059/100

Keep nerding

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

Also reads as

13188059 (identifier)

  • 8 characters
  • Checksum fails

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