Recognised as Number
-3,864,000,006
- Negative
- Even
- 10 digits
-3,864,000,006 is an even 10-digit integer and the negative of 3,864,000,006. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value3,864,000,006
Digit count10
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3^2 × 17 × 12,627,451
Distinct prime factors42, 3, 17, 12,627,451
Number of divisors24
Sum of divisors σ(n)8,864,471,304
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 17, 18, 34, 51, 102, 153, 306, 12,627,451, 25,254,902, 37,882,353, 75,764,706, 113,647,059, 214,666,667, 227,294,118, 429,333,334, 644,000,001, 1,288,000,002, 1,932,000,003, 3,864,000,00624 in total
Arithmetic
Previous number-3,864,000,007
Next number-3,864,000,005
Double-7,728,000,012
Half-1,932,000,003
Square14,930,496,046,368,000,036
Cube-57,691,436,812,748,928,417,312,000,216
Cube root-1,569.202673837≈
Negation3,864,000,006
Reciprocal-2.58799171 × 10^-10≈
Representations
Decimal-3,864,000,006
Binary1110011001001111111101100000011032 bits
Octal34623773006
HexadecimalE64FF606
Base 361RWIXHI
In wordsminus three billion, eight hundred and sixty-four million and six
Ordinalminus three billion, eight hundred and sixty-four million and sixth
Scientific notation-3.86400001 × 10^9
Engineering notation-3.864 × 10^9
In other bases
Ternary100222021210112112100base 3; the most digit-efficient integer base after e: 21 digits
Quinary30403141000011base 5; one hand: 14 digits
Septenary164516313066base 7: 12 digits
Nonary10867715470base 9; each digit is two ternary digits: 11 digits
Duodecimal8ba067146base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal307a0006base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal4:58:8:53:20:6base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0T001T011TT110111T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101110111100000001111000001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111100011001101100000000100111111010
Bit length32 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits14within that length
Bit parityeven18 set bits, so even; not the same as the number itself being even
Highest set bitbit 31worth 2,147,483,648
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes4e6 4f f6 06
Gray code10010101011010000000110100000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111100011001101100000000100111111010two's complement
One's complement0000000000000000000000000000000011100110010011111111011000000101at 64 bits, every bit flipped
Bits reversed0101111110010000000011011001100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000110011011000000001001111110101at 64 bits, wrapping
Shifted left by 1-111001100100111111110110000001100= -7,728,000,012, no wrap
Shifted right by 1-1110011001001111111101100000011= -1,932,000,003, 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,006 to the power 214,930,496,046,368,000,036
-3,864,000,006 to the power 3-57,691,436,812,748,928,417,312,000,216
-3,864,000,006 to the power 4222,919,712,190,610,480,280,987,139,338,496,001,296
-3,864,000,006 to the power 5-86136176924203716894939718808… (49 digits)
First ten multiples-3,864,000,006, -7,728,000,012, -11,592,000,018, -15,456,000,024, -19,320,000,030, -23,184,000,036, -27,048,000,042, -30,912,000,048, -34,776,000,054, -38,640,000,060
Powers of twoBetween 2^31 (2,147,483,648) and 2^32 (4,294,967,296)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10No, remainder 6
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 6
As a percentage & fraction
As a percentage-386,400,000,600%
-3,864,000,006% as a decimal-38,640,000.06
-3,864,000,006% of 100-3,864,000,006
-3,864,000,006% of 1,000-38,640,000,060
As a fraction of 100-3,864,000,006/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,006
Also reads as
3864000006 (identifier)
- 10 characters
- Checksum fails
3864000006 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