Recognised as Number
-13,360,649
- Negative
- Odd
- 8 digits
-13,360,649 is an odd 8-digit integer and the negative of 13,360,649. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,360,649
Digit count8
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13,360,649
Distinct prime factors113,360,649
Number of divisors2
Sum of divisors σ(n)13,360,650
SquarefreeYesno repeated prime factor
All divisors1, 13,360,6492 in total
Arithmetic
Previous number-13,360,650
Next number-13,360,648
Double-26,721,298
Half-6,680,324.5
Square178,506,941,701,201
Cube-2,384,968,592,133,209,439,449
Cube root-237.288041363≈
Negation13,360,649
Reciprocal-7.48466635 × 10^-8≈
Representations
Decimal-13,360,649
Binary11001011110111100000100124 bits
Octal62757011
HexadecimalCBDE09
Base 367YD55
In wordsminus thirteen million, three hundred and sixty thousand, six hundred and forty-nine
Ordinalminus thirteen million, three hundred and sixty thousand, six hundred and forty-ninth
Scientific notation-1.3360649 × 10^7
Engineering notation-13.360649 × 10^6
In other bases
Ternary221010210100212base 3; the most digit-efficient integer base after e: 15 digits
Quinary11410020044base 5; one hand: 11 digits
Septenary221364221base 7: 9 digits
Nonary27123325base 9; each digit is two ternary digits: 8 digits
Duodecimal4583a35base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal43a1c9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:1:51:17:29base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T0TT1T0T0T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101000110011000001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001101000010000111110111
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 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
Bytes3cb de 09
Gray code101011100011000100001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001101000010000111110111two's complement
64-bit1111111111111111111111111111111111111111001101000010000111110111two's complement
One's complement00000000110010111101111000001000at 32 bits, every bit flipped
Bits reversed11101111100001000010110011111111at 32 bits
Rotated left by 111111110011010000100001111101111at 32 bits, wrapping
Shifted left by 1-1100101111011110000010010= -26,721,298, no wrap
Shifted right by 1-11001011110111100000101= -6,680,324, discarding the low bit
These bits as a double6.60103768 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,360,649 to the power 2178,506,941,701,201
-13,360,649 to the power 3-2,384,968,592,133,209,439,449
-13,360,649 to the power 431,864,728,235,515,972,563,964,842,401
-13,360,649 to the power 5-425,733,449,435,118,243,320,764,307,660,078,249
First ten multiples-13,360,649, -26,721,298, -40,081,947, -53,442,596, -66,803,245, -80,163,894, -93,524,543, -106,885,192, -120,245,841, -133,606,490
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 49
As a percentage & fraction
As a percentage-1,336,064,900%
-13,360,649% as a decimal-133,606.49
-13,360,649% of 100-13,360,649
-13,360,649% of 1,000-133,606,490
As a fraction of 100-13,360,649/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,360,649
Also reads as
13360649 (identifier)
- 8 characters
- Checksum valid
13360649 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for Luhn (cards, IMEI). 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 validmod 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