Recognised as Number
-13,013,038,954,881
- Negative
- Odd
- Perfect square
- 14 digits
-13,013,038,954,881 is an odd 14-digit integer and the negative of 13,013,038,954,881. It has 81 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,013,038,954,881
Digit count14
Digit sum54
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 3,607,359²
Factors & divisors
Prime factorisation−1 × 3^2 × 7^2 × 19^2 × 9,041^2
Distinct prime factors43, 7, 19, 9,041
Number of divisors81
Sum of divisors σ(n)23,079,381,226,083
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 19, 21, 49, 57, 63, 133, 147, 171, 361, 399, 441, 931, 1,083, 1,197, 2,527, 2,793, 3,249, 7,581, 8,379, 9,041, 17,689, 22,743, 27,123, 53,067, 63,287, 81,369, 159,201, 171,779, 189,861, 443,009, 515,337, 569,583, 1,202,453, 1,329,027, 1,546,011, 3,263,801, 3,607,359, 3,987,081, 8,417,171, 9,791,403, 10,822,077, 22,846,607, 25,251,513, 29,374,209, 68,539,821, 75,754,539, 81,739,681, 159,926,249, 205,619,463, 245,219,043, 479,778,747, 572,177,767, 735,657,129, 1,439,336,241, 1,553,053,939, 1,716,533,301, 4,005,244,369, 4,659,161,817, 5,149,599,903, 10,871,377,573, 12,015,733,107, 13,977,485,451, 29,508,024,841, 32,614,132,719, 36,047,199,321, 76,099,643,011, 88,524,074,523, 97,842,398,157, 206,556,173,887, 228,298,929,033, 265,572,223,569, 619,668,521,661, 684,896,787,099, 1,445,893,217,209, 1,859,005,564,983, 4,337,679,651,627, 13,013,038,954,88181 in total
Arithmetic
Previous number-13,013,038,954,882
Next number-13,013,038,954,880
Double-26,026,077,909,762
Square169,339,182,841,250,388,753,724,161
Cube-2,203,617,382,900,907,527,002,997,612,155,998,579,841
Cube root-23,521.205518833≈
Negation13,013,038,954,881
Reciprocal-7.68460007 × 10^-14≈
Representations
Decimal-13,013,038,954,881
Binary1011110101011101010110010000011110011000000144 bits
Octal275272544074601
HexadecimalBD5D5907981
Base 364M23VENI9
In wordsminus thirteen trillion, thirteen billion, thirty-eight million, nine hundred and fifty-four thousand, eight hundred and eighty-one
Ordinalminus thirteen trillion, thirteen billion, thirty-eight million, nine hundred and fifty-four thousand, eight hundred and eighty-first
Scientific notation-1.3013039 × 10^13
Engineering notation-13.013039 × 10^12
In other bases
Ternary1201002000221001121001210100base 3; the most digit-efficient integer base after e: 28 digits
Quinary3201201200433024011base 5; one hand: 19 digits
Septenary2512106144032200base 7: 16 digits
Nonary51060831531710base 9; each digit is two ternary digits: 14 digits
Duodecimal15620204bb769base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal15868ed9741base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal4:38:54:52:30:43:1:21base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT110T0T100T01T0T111T0T11T0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000111111001111111101100001001101110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111101000010101000101010011011111000011001111111
Bit length44 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits22within that length
Bit parityeven22 set bits, so even; not the same as the number itself being odd
Highest set bitbit 43worth 8,796,093,022,208
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes60b d5 d5 90 79 81
Gray code11100011111100111111010110000100010101000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111101000010101000101010011011111000011001111111two's complement
One's complement0000000000000000000010111101010111010101100100000111100110000000at 64 bits, every bit flipped
Bits reversed1111111001100001111101100101010001010100001011111111111111111111at 64 bits
Rotated left by 11111111111111111111010000101010001010100110111110000110011111111at 64 bits, wrapping
Shifted left by 1-101111010101110101011001000001111001100000010= -26,026,077,909,762, no wrap
Shifted right by 1-1011110101011101010110010000011110011000001= -6,506,519,477,440, discarding the low bit
These bits as a double6.4292955 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below13,013,038,954,881
Nearest square above13,013,046,169,600
Powers & multiples
-13,013,038,954,881 to the power 2169,339,182,841,250,388,753,724,161
-13,013,038,954,881 to the power 3-22036173829009075270029976121… (41 digits)
-13,013,038,954,881 to the power 4286757588453424300851775143330… (53 digits)
-13,013,038,954,881 to the power 5-37315876691521444771018321292… (67 digits)
First ten multiples-13,013,038,954,881, -26,026,077,909,762, -39,039,116,864,643, -52,052,155,819,524, -65,065,194,774,405, -78,078,233,729,286, -91,091,272,684,167, -104,104,311,639,048, -117,117,350,593,929, -130,130,389,548,810
Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 81
As a percentage & fraction
As a percentage-1.3013039 × 10^15%
-13,013,038,954,881% as a decimal-130,130,389,548.81
-13,013,038,954,881% of 100-13,013,038,954,881
-13,013,038,954,881% of 1,000-130,130,389,548,810
As a fraction of 100-13,013,038,954,881/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,013,038,954,881
Also reads as
13013038954881 (identifier)
- 14 characters
- Checksum valid
13013038954881 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). The check digit is valid for GTIN-14 (case/carton). 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-14 (case/carton)Check digit validGS1 mod 10, weights 3 and 1 alternating from the right
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