Recognised as Number
-3,964,107,891
- Negative
- Odd
- 10 digits
-3,964,107,891 is an odd 10-digit integer and the negative of 3,964,107,891. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,964,107,891
Digit count10
Digit sum48
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 × 23 × 167 × 344,017
Distinct prime factors43, 23, 167, 344,017
Number of divisors16
Sum of divisors σ(n)5,548,322,304
SquarefreeYesno repeated prime factor
All divisors1, 3, 23, 69, 167, 501, 3,841, 11,523, 344,017, 1,032,051, 7,912,391, 23,737,173, 57,450,839, 172,352,517, 1,321,369,297, 3,964,107,89116 in total
Arithmetic
Previous number-3,964,107,892
Next number-3,964,107,890
Double-7,928,215,782
Half-1,982,053,945.5
Square15,714,151,371,488,467,881
Cube-62,292,591,452,085,907,942,572,148,971
Cube root-1,582.638848679≈
Negation3,964,107,891
Reciprocal-2.52263568 × 10^-10≈
Representations
Decimal-3,964,107,891
Binary1110110001000111011111000111001132 bits
Octal35421676163
HexadecimalEC477C73
Base 361TK4L83
In wordsminus three billion, nine hundred and sixty-four million, one hundred and seven thousand, eight hundred and ninety-one
Ordinalminus three billion, nine hundred and sixty-four million, one hundred and seven thousand, eight hundred and ninety-first
Scientific notation-3.96410789 × 10^9
Engineering notation-3.964108 × 10^9
In other bases
Ternary101020021011112201210base 3; the most digit-efficient integer base after e: 21 digits
Quinary31104302423031base 5; one hand: 14 digits
Septenary200143234602base 7: 12 digits
Nonary11207145653base 9; each digit is two ternary digits: 11 digits
Duodecimal9276a3b03base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal31ifd9ebbase 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal5:5:52:21:4:51base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0TT10T1TT111101T11T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100010100110010011000010010011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111100010011101110001000001110001101
Bit length32 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits13within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 31worth 2,147,483,648
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes4ec 47 7c 73
Gray code10011010011001001100001001001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111100010011101110001000001110001101two's complement
One's complement0000000000000000000000000000000011101100010001110111110001110010at 64 bits, every bit flipped
Bits reversed1011000111000001000111011100100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000100111011100010000011100011011at 64 bits, wrapping
Shifted left by 1-111011000100011101111100011100110= -7,928,215,782, no wrap
Shifted right by 1-1110110001000111011111000111010= -1,982,053,945, discarding the low bit
These bits as a double1.95852953 × 10^-314≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-3,964,107,891 to the power 215,714,151,371,488,467,881
-3,964,107,891 to the power 3-62,292,591,452,085,907,942,572,148,971
-3,964,107,891 to the power 4246,934,553,326,052,896,085,049,830,572,768,630,161
-3,964,107,891 to the power 5-97887521140036658125414904050… (49 digits)
First ten multiples-3,964,107,891, -7,928,215,782, -11,892,323,673, -15,856,431,564, -19,820,539,455, -23,784,647,346, -27,748,755,237, -31,712,863,128, -35,676,971,019, -39,641,078,910
Powers of twoBetween 2^31 (2,147,483,648) and 2^32 (4,294,967,296)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-396,410,789,100%
-3,964,107,891% as a decimal-39,641,078.91
-3,964,107,891% of 100-3,964,107,891
-3,964,107,891% of 1,000-39,641,078,910
As a fraction of 100-3,964,107,891/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,964,107,891
Also reads as
3964107891 (identifier)
- 10 characters
- Checksum valid
3964107891 matches the shape of ISBN-10, Luhn (cards, IMEI). The check digit is valid for ISBN-10. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
ISBN-10Check digit validmod 11 with weights 10 down to 1
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
Structure
As ISBN-139783964107893the 978 prefix plus a recomputed check digit
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