Nerdulator> put something in

Recognised as Number

-13,218,775

  • Negative
  • Odd
  • 8 digits

-13,218,775 is an odd 8-digit integer and the negative of 13,218,775. It has 24 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value13,218,775
Digit count8
Digit sum34
Digit product11,760
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 5^2 × 17 × 19 × 1,637
Distinct prime factors45, 17, 19, 1,637
Number of divisors24
Sum of divisors σ(n)18,280,080
SquarefreeNohas a repeated prime factor
All divisors1, 5, 17, 19, 25, 85, 95, 323, 425, 475, 1,615, 1,637, 8,075, 8,185, 27,829, 31,103, 40,925, 139,145, 155,515, 528,751, 695,725, 777,575, 2,643,755, 13,218,77524 in total

Arithmetic

Previous number-13,218,776
Next number-13,218,774
Cube-2,309,796,033,642,949,234,375
Cube root-236.445146377
Negation13,218,775
Reciprocal-7.56499751 × 10^-8

Representations

Decimal-13,218,775
Binary11001001101100111101011124 bits
Octal62331727
HexadecimalC9B3D7
Base 367VBO7
In wordsminus thirteen million, two hundred and eighteen thousand, seven hundred and seventy-five
Ordinalminus thirteen million, two hundred and eighteen thousand, seven hundred and seventy-fifth
Scientific notation-1.3218775 × 10^7
Engineering notation-13.218775 × 10^6

In other bases

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

Bit-level

11111111001101100100110000101001
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 b3 d7
Gray code101011010110101000111100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111001101100100110000101001two's complement
64-bit1111111111111111111111111111111111111111001101100100110000101001two's complement
One's complement00000000110010011011001111010110at 32 bits, every bit flipped
Bits reversed10010100001100100110110011111111at 32 bits
Rotated left by 111111110011011001001100001010011at 32 bits, wrapping
Shifted left by 1-1100100110110011110101110= -26,437,550, no wrap
Shifted right by 1-11001001101100111101100= -6,609,387, discarding the low bit
These bits as a double6.53094261 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+13,218,777
Nearest square below13,213,225
Nearest square above13,220,496

Powers & multiples

-13,218,775 to the power 2174,736,012,500,625
-13,218,775 to the power 3-2,309,796,033,642,949,234,375
-13,218,775 to the power 430,532,674,064,618,576,265,625,390,625
-13,218,775 to the power 5-403,604,548,608,528,420,475,642,272,958,984,375
First ten multiples-13,218,775, -26,437,550, -39,656,325, -52,875,100, -66,093,875, -79,312,650, -92,531,425, -105,750,200, -118,968,975, -132,187,750
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 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 75

As a percentage & fraction

As a percentage-1,321,877,500%
-13,218,775% as a decimal-132,187.75
-13,218,775% of 100-13,218,775
-13,218,775% of 1,000-132,187,750
As a fraction of 100-13,218,775/100

Keep nerding

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

Also reads as

13218775 (identifier)

  • 8 characters
  • Checksum valid

13218775 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.

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 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

Every value on this page was computed from “-13218775” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.