Recognised as Number
-13,487,565
- Negative
- Odd
- 8 digits
-13,487,565 is an odd 8-digit integer and the negative of 13,487,565. It has 64 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,487,565
Digit count8
Digit sum39
Digit product100,800
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5 × 7 × 13 × 41 × 241
Distinct prime factors63, 5, 7, 13, 41, 241
Number of divisors64
Sum of divisors σ(n)27,320,832
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 7, 13, 15, 21, 35, 39, 41, 65, 91, 105, 123, 195, 205, 241, 273, 287, 455, 533, 615, 723, 861, 1,205, 1,365, 1,435, 1,599, 1,687, 2,665, 3,133, 3,615, 3,731, 4,305, 5,061, 7,995, 8,435, 9,399, 9,881, 11,193, 15,665, 18,655, 21,931, 25,305, 29,643, 46,995, 49,405, 55,965, 65,793, 69,167, 109,655, 128,453, 148,215, 207,501, 328,965, 345,835, 385,359, 642,265, 899,171, 1,037,505, 1,926,795, 2,697,513, 4,495,855, 13,487,56564 in total
Arithmetic
Previous number-13,487,566
Next number-13,487,564
Double-26,975,130
Half-6,743,782.5
Square181,914,409,629,225
Cube-2,453,582,424,310,798,087,125
Cube root-238.037026699≈
Negation13,487,565
Reciprocal-7.41423674 × 10^-8≈
Representations
Decimal-13,487,565
Binary11001101110011011100110124 bits
Octal63346715
HexadecimalCDCDCD
Base 368132L
In wordsminus thirteen million, four hundred and eighty-seven thousand, five hundred and sixty-five
Ordinalminus thirteen million, four hundred and eighty-seven thousand, five hundred and sixty-fifth
Scientific notation-1.3487565 × 10^7
Engineering notation-13.487565 × 10^6
In other bases
Ternary221101020110110base 3; the most digit-efficient integer base after e: 15 digits
Quinary11423100230base 5; one hand: 11 digits
Septenary222433230base 7: 9 digits
Nonary27336413base 9; each digit is two ternary digits: 8 digits
Duodecimal4625379base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal445ii5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:2:26:32:45base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01TT0TT10TT0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101100111011001110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001100100011001000110011
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 cd
Gray code101010110010101100101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001100100011001000110011two's complement
64-bit1111111111111111111111111111111111111111001100100011001000110011two's complement
One's complement00000000110011011100110111001100at 32 bits, every bit flipped
Bits reversed11001100010011000100110011111111at 32 bits
Rotated left by 111111110011001000110010001100111at 32 bits, wrapping
Shifted left by 1-1100110111001101110011010= -26,975,130, no wrap
Shifted right by 1-11001101110011011100111= -6,743,782, discarding the low bit
These bits as a double6.66374251 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,487,565 to the power 2181,914,409,629,225
-13,487,565 to the power 3-2,453,582,424,310,798,087,125
-13,487,565 to the power 433,092,852,430,749,469,401,974,100,625
-13,487,565 to the power 5-446,341,998,195,141,467,274,636,810,496,228,125
First ten multiples-13,487,565, -26,975,130, -40,462,695, -53,950,260, -67,437,825, -80,925,390, -94,412,955, -107,900,520, -121,388,085, -134,875,650
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
As a percentage & fraction
As a percentage-1,348,756,500%
-13,487,565% as a decimal-134,875.65
-13,487,565% of 100-13,487,565
-13,487,565% of 1,000-134,875,650
As a fraction of 100-13,487,565/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,565
Also reads as
13487565 (identifier)
- 8 characters
- Checksum fails
13487565 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