Recognised as Number
-3,864,000,004
- Negative
- Even
- 10 digits
-3,864,000,004 is an even 10-digit integer and the negative of 3,864,000,004. It has 12 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value3,864,000,004
Digit count10
Digit sum25
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 × 2^2 × 151 × 6,397,351
Distinct prime factors32, 151, 6,397,351
Number of divisors12
Sum of divisors σ(n)6,806,782,528
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 151, 302, 604, 6,397,351, 12,794,702, 25,589,404, 966,000,001, 1,932,000,002, 3,864,000,00412 in total
Arithmetic
Previous number-3,864,000,005
Next number-3,864,000,003
Double-7,728,000,008
Half-1,932,000,002
Square14,930,496,030,912,000,016
Cube-57,691,436,723,165,952,185,472,000,064
Cube root-1,569.202673566≈
Negation3,864,000,004
Reciprocal-2.58799172 × 10^-10≈
Representations
Decimal-3,864,000,004
Binary1110011001001111111101100000010032 bits
Octal34623773004
HexadecimalE64FF604
Base 361RWIXHG
In wordsminus three billion, eight hundred and sixty-four million and four
Ordinalminus three billion, eight hundred and sixty-four million and fourth
Scientific notation-3.864 × 10^9
Engineering notation-3.864 × 10^9
In other bases
Ternary100222021210112112021base 3; the most digit-efficient integer base after e: 21 digits
Quinary30403141000004base 5; one hand: 14 digits
Septenary164516313064base 7: 12 digits
Nonary10867715467base 9; each digit is two ternary digits: 11 digits
Duodecimal8ba067144base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal307a0004base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal4:58:8:53:20:4base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0T001T011TT110111T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101110111100000001111000001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111100011001101100000000100111111100
Bit length32 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits15within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being even
Highest set bitbit 31worth 2,147,483,648
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes4e6 4f f6 04
Gray code10010101011010000000110100000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111100011001101100000000100111111100two's complement
One's complement0000000000000000000000000000000011100110010011111111011000000011at 64 bits, every bit flipped
Bits reversed0011111110010000000011011001100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000110011011000000001001111111001at 64 bits, wrapping
Shifted left by 1-111001100100111111110110000001000= -7,728,000,008, no wrap
Shifted right by 1-1110011001001111111101100000010= -1,932,000,002, discarding the low bit
These bits as a double1.90906966 × 10^-314≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-3,864,000,004 to the power 214,930,496,030,912,000,016
-3,864,000,004 to the power 3-57,691,436,723,165,952,185,472,000,064
-3,864,000,004 to the power 4222,919,711,729,078,986,137,327,616,989,184,000,256
-3,864,000,004 to the power 5-86136176701284004935094985659… (49 digits)
First ten multiples-3,864,000,004, -7,728,000,008, -11,592,000,012, -15,456,000,016, -19,320,000,020, -23,184,000,024, -27,048,000,028, -30,912,000,032, -34,776,000,036, -38,640,000,040
Powers of twoBetween 2^31 (2,147,483,648) and 2^32 (4,294,967,296)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 4
Divisible by 11No, remainder 7
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
As a percentage & fraction
As a percentage-386,400,000,400%
-3,864,000,004% as a decimal-38,640,000.04
-3,864,000,004% of 100-3,864,000,004
-3,864,000,004% of 1,000-38,640,000,040
As a fraction of 100-3,864,000,004/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,864,000,004
Also reads as
3864000004 (identifier)
- 10 characters
- Checksum fails
3864000004 matches the shape of ISBN-10, 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-10Check digit does not matchmod 11 with weights 10 down to 1
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