Recognised as Number
-13,487,563
- Negative
- Odd
- 8 digits
-13,487,563 is an odd 8-digit integer and the negative of 13,487,563. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,487,563
Digit count8
Digit sum37
Digit product60,480
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13,487,563
Distinct prime factors113,487,563
Number of divisors2
Sum of divisors σ(n)13,487,564
SquarefreeYesno repeated prime factor
All divisors1, 13,487,5632 in total
Arithmetic
Previous number-13,487,564
Next number-13,487,562
Double-26,975,126
Half-6,743,781.5
Square181,914,355,678,969
Cube-2,453,581,332,824,502,162,547
Cube root-238.037014934≈
Negation13,487,563
Reciprocal-7.41423784 × 10^-8≈
Representations
Decimal-13,487,563
Binary11001101110011011100101124 bits
Octal63346713
HexadecimalCDCDCB
Base 368132J
In wordsminus thirteen million, four hundred and eighty-seven thousand, five hundred and sixty-three
Ordinalminus thirteen million, four hundred and eighty-seven thousand, five hundred and sixty-third
Scientific notation-1.3487563 × 10^7
Engineering notation-13.487563 × 10^6
In other bases
Ternary221101020110101base 3; the most digit-efficient integer base after e: 15 digits
Quinary11423100223base 5; one hand: 11 digits
Septenary222433225base 7: 9 digits
Nonary27336411base 9; each digit is two ternary digits: 8 digits
Duodecimal4625377base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal445ii3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:2:26:32:43base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01TT0TT10TT0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101100111011001110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001100100011001000110101
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
Bytes3cd cd cb
Gray code101010110010101100101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001100100011001000110101two's complement
64-bit1111111111111111111111111111111111111111001100100011001000110101two's complement
One's complement00000000110011011100110111001010at 32 bits, every bit flipped
Bits reversed10101100010011000100110011111111at 32 bits
Rotated left by 111111110011001000110010001101011at 32 bits, wrapping
Shifted left by 1-1100110111001101110010110= -26,975,126, no wrap
Shifted right by 1-11001101110011011100110= -6,743,781, discarding the low bit
These bits as a double6.66374152 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,487,563 to the power 2181,914,355,678,969
-13,487,563 to the power 3-2,453,581,332,824,502,162,547
-13,487,563 to the power 433,092,832,802,094,440,860,988,902,961
-13,487,563 to the power 5-446,341,667,266,715,303,062,362,070,987,374,043
First ten multiples-13,487,563, -26,975,126, -40,462,689, -53,950,252, -67,437,815, -80,925,378, -94,412,941, -107,900,504, -121,388,067, -134,875,630
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 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 63
As a percentage & fraction
As a percentage-1,348,756,300%
-13,487,563% as a decimal-134,875.63
-13,487,563% of 100-13,487,563
-13,487,563% of 1,000-134,875,630
As a fraction of 100-13,487,563/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,487,563
Also reads as
13487563 (identifier)
- 8 characters
- Checksum fails
13487563 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.
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