Recognised as Number
-3,988,663,484,779
- Negative
- Odd
- Perfect cube
- 13 digits
-3,988,663,484,779 is an odd 13-digit integer and the negative of 3,988,663,484,779. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,988,663,484,779
Digit count13
Digit sum82
Digit product10,534,551,552
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -15,859³
Factors & divisors
Prime factorisation−1 × 15,859^3
Distinct prime factors115,859
Number of divisors4
Sum of divisors σ(n)3,988,915,008,520
SquarefreeNohas a repeated prime factor
All divisors1, 15,859, 251,507,881, 3,988,663,484,7794 in total
Arithmetic
Previous number-3,988,663,484,780
Next number-3,988,663,484,778
Double-7,977,326,969,558
Square15,909,436,394,809,355,964,678,841
Cube-63,457,388,011,390,136,229,428,575,180,626,861,139
Cube root-15,859
Negation3,988,663,484,779
Reciprocal-2.50710546 × 10^-13≈
Representations
Decimal-3,988,663,484,779
Binary11101000001010111011011110110000010110101142 bits
Octal72025667540553
Hexadecimal3A0AEDEC16B
Base 361EWD795YJ
In wordsminus three trillion, nine hundred and eighty-eight billion, six hundred and sixty-three million, four hundred and eighty-four thousand, seven hundred and seventy-nine
Ordinalminus three trillion, nine hundred and eighty-eight billion, six hundred and sixty-three million, four hundred and eighty-four thousand, seven hundred and seventy-ninth
Scientific notation-3.98866348 × 10^12
Engineering notation-3.988663 × 10^12
In other bases
Ternary112010022102211001001121001base 3; the most digit-efficient integer base after e: 27 digits
Quinary1010322240323003104base 5; one hand: 19 digits
Septenary561112541135251base 7: 15 digits
Nonary15108384031531base 9; each digit is two ternary digits: 14 digits
Duodecimal5450433b7577base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal7fg2h6fbijbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:25:29:27:14:39:6:19base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT1110T0T01TT01TT00T0T111T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011010001101010001011000010100001110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111000101111101010001001000010011111010010101
Bit length42 bitsto write the magnitude
Set bits23the population count, or Hamming weight
Zero bits19within that length
Bit parityodd23 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 41worth 2,199,023,255,552
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes603 a0 ae de c1 6b
Gray code100111000011111001101100011010000111011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111000101111101010001001000010011111010010101two's complement
One's complement0000000000000000000000111010000010101110110111101100000101101010at 64 bits, every bit flipped
Bits reversed1010100101111100100001001000101011111010001111111111111111111111at 64 bits
Rotated left by 11111111111111111111110001011111010100010010000100111110100101011at 64 bits, wrapping
Shifted left by 1-1110100000101011101101111011000001011010110= -7,977,326,969,558, no wrap
Shifted right by 1-11101000001010111011011110110000010110110= -1,994,331,742,389, discarding the low bit
These bits as a double1.9706616 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below3,988,660,048,569
Nearest square above3,988,664,042,896
Powers & multiples
-3,988,663,484,779 to the power 215,909,436,394,809,355,964,678,841
-3,988,663,484,779 to the power 3-63,457,388,011,390,136,229,428,575,180,626,861,139
-3,988,663,484,779 to the power 4253110166400484517716980120131… (51 digits)
-3,988,663,484,779 to the power 5-10095712783479491353510470912… (65 digits)
First ten multiples-3,988,663,484,779, -7,977,326,969,558, -11,965,990,454,337, -15,954,653,939,116, -19,943,317,423,895, -23,931,980,908,674, -27,920,644,393,453, -31,909,307,878,232, -35,897,971,363,011, -39,886,634,847,790
Powers of twoBetween 2^41 (2,199,023,255,552) and 2^42 (4,398,046,511,104)
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 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
As a percentage & fraction
As a percentage-398,866,348,477,900%
-3,988,663,484,779% as a decimal-39,886,634,847.79
-3,988,663,484,779% of 100-3,988,663,484,779
-3,988,663,484,779% of 1,000-39,886,634,847,790
As a fraction of 100-3,988,663,484,779/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -3,988,663,484,779
Also reads as
3988663484779 (identifier)
- 13 characters
- Checksum fails
3988663484779 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). 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
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
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