Recognised as Number
-13,264,013
- Negative
- Odd
- 8 digits
-13,264,013 is an odd 8-digit integer and the negative of 13,264,013. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,264,013
Digit count8
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 1,894,859
Distinct prime factors27, 1,894,859
Number of divisors4
Sum of divisors σ(n)15,158,880
SquarefreeYesno repeated prime factor
All divisors1, 7, 1,894,859, 13,264,0134 in total
Arithmetic
Previous number-13,264,014
Next number-13,264,012
Double-26,528,026
Half-6,632,006.5
Square175,934,040,864,169
Cube-2,333,591,405,164,868,850,197
Cube root-236.714564354≈
Negation13,264,013
Reciprocal-7.53919647 × 10^-8≈
Representations
Decimal-13,264,013
Binary11001010011001001000110124 bits
Octal62462215
HexadecimalCA648D
Base 367WAKT
In wordsminus thirteen million, two hundred and sixty-four thousand and thirteen
Ordinalminus thirteen million, two hundred and sixty-four thousand and thirteenth
Scientific notation-1.3264013 × 10^7
Engineering notation-13.264013 × 10^6
In other bases
Ternary220221212210202base 3; the most digit-efficient integer base after e: 15 digits
Quinary11343422023base 5; one hand: 11 digits
Septenary220512410base 7: 9 digits
Nonary26855722base 9; each digit is two ternary digits: 8 digits
Duodecimal4537b25base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal42i00dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:1:24:26:53base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T0010101TT1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010010101110110010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001101011001101101110011
Bit length24 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits13within that length
Bit parityodd11 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
Bytes3ca 64 8d
Gray code101011110101011011001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001101011001101101110011two's complement
64-bit1111111111111111111111111111111111111111001101011001101101110011two's complement
One's complement00000000110010100110010010001100at 32 bits, every bit flipped
Bits reversed11001110110110011010110011111111at 32 bits
Rotated left by 111111110011010110011011011100111at 32 bits, wrapping
Shifted left by 1-1100101001100100100011010= -26,528,026, no wrap
Shifted right by 1-11001010011001001000111= -6,632,006, discarding the low bit
These bits as a double6.55329315 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,264,013 to the power 2175,934,040,864,169
-13,264,013 to the power 3-2,333,591,405,164,868,850,197
-13,264,013 to the power 430,952,786,734,795,087,572,308,060,561
-13,264,013 to the power 5-410,558,165,636,549,593,895,232,555,285,891,293
First ten multiples-13,264,013, -26,528,026, -39,792,039, -53,056,052, -66,320,065, -79,584,078, -92,848,091, -106,112,104, -119,376,117, -132,640,130
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 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-1,326,401,300%
-13,264,013% as a decimal-132,640.13
-13,264,013% of 100-13,264,013
-13,264,013% of 1,000-132,640,130
As a fraction of 100-13,264,013/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,264,013
Also reads as
13264013 (identifier)
- 8 characters
- Checksum fails
13264013 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