Recognised as Number
-13,013,038,954,879
- Negative
- Odd
- 14 digits
-13,013,038,954,879 is an odd 14-digit integer and the negative of 13,013,038,954,879. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value13,013,038,954,879
Digit count14
Digit sum61
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 503 × 25,870,852,793
Distinct prime factors2503, 25,870,852,793
Number of divisors4
Sum of divisors σ(n)13,038,909,808,176
SquarefreeYesno repeated prime factor
All divisors1, 503, 25,870,852,793, 13,013,038,954,8794 in total
Arithmetic
Previous number-13,013,038,954,880
Next number-13,013,038,954,878
Double-26,026,077,909,758
Square169,339,182,841,198,336,597,904,641
Cube-2,203,617,382,899,891,491,905,950,265,979,943,693,439
Cube root-23,521.205518832≈
Negation13,013,038,954,879
Reciprocal-7.68460007 × 10^-14≈
Representations
Decimal-13,013,038,954,879
Binary1011110101011101010110010000011110010111111144 bits
Octal275272544074577
HexadecimalBD5D590797F
Base 364M23VENI7
In wordsminus thirteen trillion, thirteen billion, thirty-eight million, nine hundred and fifty-four thousand, eight hundred and seventy-nine
Ordinalminus thirteen trillion, thirteen billion, thirty-eight million, nine hundred and fifty-four thousand, eight hundred and seventy-ninth
Scientific notation-1.3013039 × 10^13
Engineering notation-13.013039 × 10^12
In other bases
Ternary1201002000221001121001210021base 3; the most digit-efficient integer base after e: 28 digits
Quinary3201201200433024004base 5; one hand: 19 digits
Septenary2512106144032165base 7: 16 digits
Nonary51060831531707base 9; each digit is two ternary digits: 14 digits
Duodecimal15620204bb767base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal15868ed973jbase 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal4:38:54:52:30:43:1:19base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT110T0T100T01T0T111T0T11T0T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000111111001111111101100001001101110000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111101000010101000101010011011111000011010000001
Bit length44 bitsto write the magnitude
Set bits27the population count, or Hamming weight
Zero bits17within that length
Bit parityodd27 set bits, so odd; 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 7f
Gray code11100011111100111111010110000100010111000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111101000010101000101010011011111000011010000001two's complement
One's complement0000000000000000000010111101010111010101100100000111100101111110at 64 bits, every bit flipped
Bits reversed1000000101100001111101100101010001010100001011111111111111111111at 64 bits
Rotated left by 11111111111111111111010000101010001010100110111110000110100000011at 64 bits, wrapping
Shifted left by 1-101111010101110101011001000001111001011111110= -26,026,077,909,758, no wrap
Shifted right by 1-1011110101011101010110010000011110011000000= -6,506,519,477,439, 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,031,740,164
Nearest square above13,013,038,954,881
Powers & multiples
-13,013,038,954,879 to the power 2169,339,182,841,198,336,597,904,641
-13,013,038,954,879 to the power 3-22036173828998914919059502659… (41 digits)
-13,013,038,954,879 to the power 4286757588453248011461143111369… (53 digits)
-13,013,038,954,879 to the power 5-37315876691492769012172987676… (67 digits)
First ten multiples-13,013,038,954,879, -26,026,077,909,758, -39,039,116,864,637, -52,052,155,819,516, -65,065,194,774,395, -78,078,233,729,274, -91,091,272,684,153, -104,104,311,639,032, -117,117,350,593,911, -130,130,389,548,790
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 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
As a percentage & fraction
As a percentage-1.3013039 × 10^15%
-13,013,038,954,879% as a decimal-130,130,389,548.79
-13,013,038,954,879% of 100-13,013,038,954,879
-13,013,038,954,879% of 1,000-130,130,389,548,790
As a fraction of 100-13,013,038,954,879/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,879
Also reads as
13013038954879 (identifier)
- 14 characters
- Checksum valid
13013038954879 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). 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-14 (case/carton)Check digit does not matchGS1 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