Recognised as Number
-13,330,587
- Negative
- Odd
- 8 digits
-13,330,587 is an odd 8-digit integer and the negative of 13,330,587. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,330,587
Digit count8
Digit sum30
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 4,443,529
Distinct prime factors23, 4,443,529
Number of divisors4
Sum of divisors σ(n)17,774,120
SquarefreeYesno repeated prime factor
All divisors1, 3, 4,443,529, 13,330,5874 in total
Arithmetic
Previous number-13,330,588
Next number-13,330,586
Double-26,661,174
Half-6,665,293.5
Square177,704,549,764,569
Cube-2,368,905,960,932,416,572,003
Cube root-237.10993849≈
Negation13,330,587
Reciprocal-7.50154513 × 10^-8≈
Representations
Decimal-13,330,587
Binary11001011011010001001101124 bits
Octal62664233
HexadecimalCB689B
Base 367XPY3
In wordsminus thirteen million, three hundred and thirty thousand, five hundred and eighty-seven
Ordinalminus thirteen million, three hundred and thirty thousand, five hundred and eighty-seventh
Scientific notation-1.3330587 × 10^7
Engineering notation-13.330587 × 10^6
In other bases
Ternary221002021010110base 3; the most digit-efficient integer base after e: 15 digits
Quinary11403034322base 5; one hand: 11 digits
Septenary221210454base 7: 9 digits
Nonary27067113base 9; each digit is two ternary digits: 8 digits
Duodecimal456a563base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal436697base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:1:42:56:27base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT01T0T1T1T0T0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101011110100010100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111001101001001011101100101
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 68 9b
Gray code101011101101110011010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111001101001001011101100101two's complement
64-bit1111111111111111111111111111111111111111001101001001011101100101two's complement
One's complement00000000110010110110100010011010at 32 bits, every bit flipped
Bits reversed10100110111010010010110011111111at 32 bits
Rotated left by 111111110011010010010111011001011at 32 bits, wrapping
Shifted left by 1-1100101101101000100110110= -26,661,174, no wrap
Shifted right by 1-11001011011010001001110= -6,665,293, discarding the low bit
These bits as a double6.58618508 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-13,330,587 to the power 2177,704,549,764,569
-13,330,587 to the power 3-2,368,905,960,932,416,572,003
-13,330,587 to the power 431,578,907,007,028,180,233,327,755,761
-13,330,587 to the power 5-420,965,367,222,098,768,052,055,947,686,761,707
First ten multiples-13,330,587, -26,661,174, -39,991,761, -53,322,348, -66,652,935, -79,983,522, -93,314,109, -106,644,696, -119,975,283, -133,305,870
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 87
As a percentage & fraction
As a percentage-1,333,058,700%
-13,330,587% as a decimal-133,305.87
-13,330,587% of 100-13,330,587
-13,330,587% of 1,000-133,305,870
As a fraction of 100-13,330,587/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,330,587
Also reads as
13330587 (identifier)
- 8 characters
- Checksum fails
13330587 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