Recognised as Number
-3,947,115,960,199
- Negative
- Odd
- 13 digits
-3,947,115,960,199 is an odd 13-digit integer and the negative of 3,947,115,960,199. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,947,115,960,199
Digit count13
Digit sum64
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3,947,115,960,199
Distinct prime factors13,947,115,960,199
Number of divisors2
Sum of divisors σ(n)3,947,115,960,200
SquarefreeYesno repeated prime factor
All divisors1, 3,947,115,960,1992 in total
Arithmetic
Previous number-3,947,115,960,200
Next number-3,947,115,960,198
Double-7,894,231,920,398
Square15,579,724,403,257,673,752,119,601
Cube-61,494,978,847,600,205,215,712,638,012,603,760,599
Cube root-15,803.743118128≈
Negation3,947,115,960,199
Reciprocal-2.53349537 × 10^-13≈
Representations
Decimal-3,947,115,960,199
Binary11100101110000001001110001110101111000011142 bits
Octal71340234353607
Hexadecimal3970271D787
Base 361EDA2XITJ
In wordsminus three trillion, nine hundred and forty-seven billion, one hundred and fifteen million, nine hundred and sixty thousand, one hundred and ninety-nine
Ordinalminus three trillion, nine hundred and forty-seven billion, one hundred and fifteen million, nine hundred and sixty thousand, one hundred and ninety-ninth
Scientific notation-3.94711596 × 10^12
Engineering notation-3.947116 × 10^12
In other bases
Ternary111222100012022001010110101base 3; the most digit-efficient integer base after e: 27 digits
Quinary1004132143141211244base 5; one hand: 19 digits
Septenary555112133042056base 7: 15 digits
Nonary14870168033411base 9; each digit is two ternary digits: 14 digits
Duodecimal538b89195147base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal7e3ddef09jbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:24:36:1:25:0:3:19base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT111001T00T11T0100T0T0TT0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011011100100000010100100100111100110001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111000110100011111101100011100010100001111001
Bit length42 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits20within that length
Bit parityeven22 set bits, so even; 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 97 02 71 d7 87
Gray code100101110010000011010010010011110001000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111000110100011111101100011100010100001111001two's complement
One's complement0000000000000000000000111001011100000010011100011101011110000110at 64 bits, every bit flipped
Bits reversed1001111000010100011100011011111100010110001111111111111111111111at 64 bits
Rotated left by 11111111111111111111110001101000111111011000111000101000011110011at 64 bits, wrapping
Shifted left by 1-1110010111000000100111000111010111100001110= -7,894,231,920,398, no wrap
Shifted right by 1-11100101110000001001110001110101111000100= -1,973,557,980,099, discarding the low bit
These bits as a double1.9501344 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below3,947,111,986,756
Nearest square above3,947,115,960,225
Powers & multiples
-3,947,115,960,199 to the power 215,579,724,403,257,673,752,119,601
-3,947,115,960,199 to the power 3-61,494,978,847,600,205,215,712,638,012,603,760,599
-3,947,115,960,199 to the power 4242727812481462678496887037111… (51 digits)
-3,947,115,960,199 to the power 5-95807482262977137712322270751… (64 digits)
First ten multiples-3,947,115,960,199, -7,894,231,920,398, -11,841,347,880,597, -15,788,463,840,796, -19,735,579,800,995, -23,682,695,761,194, -27,629,811,721,393, -31,576,927,681,592, -35,524,043,641,791, -39,471,159,601,990
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 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 99
As a percentage & fraction
As a percentage-394,711,596,019,900%
-3,947,115,960,199% as a decimal-39,471,159,601.99
-3,947,115,960,199% of 100-3,947,115,960,199
-3,947,115,960,199% of 1,000-39,471,159,601,990
As a fraction of 100-3,947,115,960,199/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,947,115,960,199
Also reads as
3947115960199 (identifier)
- 13 characters
- Checksum fails
3947115960199 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