Nerdulator> put something in

Recognised as Number

-3,864,000,000

  • Negative
  • Even
  • 10 digits

-3,864,000,000 is an even 10-digit integer and the negative of 3,864,000,000. It has 560 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value3,864,000,000
Digit count10
Digit sum21
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 × 2^9 × 3 × 5^6 × 7 × 23
Distinct prime factors52, 3, 5, 7, 23
Number of divisors560
Sum of divisors σ(n)15,344,803,584
SquarefreeNohas a repeated prime factor
All divisors560 divisors, too many to listlisting is capped at 512

Arithmetic

Previous number-3,864,000,001
Next number-3,863,999,999
Square14,930,496,000,000,000,000
Cube-57,691,436,544,000,000,000,000,000,000
Cube root-1,569.202673025
Reciprocal-2.58799172 × 10^-10

Representations

Decimal-3,864,000,000
Binary1110011001001111111101100000000032 bits
Octal34623773000
HexadecimalE64FF600
Base 361RWIXHC
In wordsminus three billion, eight hundred and sixty-four million
Ordinalminus three billion, eight hundred and sixty-four millionth
Scientific notation-3.864 × 10^9
Engineering notation-3.864 × 10^9

In other bases

Ternary100222021210112112010base 3; the most digit-efficient integer base after e: 21 digits
Quinary30403141000000base 5; one hand: 14 digits
Septenary164516313060base 7: 12 digits
Nonary10867715463base 9; each digit is two ternary digits: 11 digits
Duodecimal8ba067140base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal307a0000base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal4:58:8:53:20:0base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0T001T011TT1101110T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101110111100000001111000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111111111111111111111111111100011001101100000000101000000000
Bit length32 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits16within that length
Bit parityeven16 set bits, so even; not the same as the number itself being even
Highest set bitbit 31worth 2,147,483,648
Lowest set bitbit 99 trailing zeros
Power of twoNo
Bytes4e6 4f f6 00
Gray code10010101011010000000110100000000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit1111111111111111111111111111111100011001101100000000101000000000two's complement
One's complement0000000000000000000000000000000011100110010011111111010111111111at 64 bits, every bit flipped
Bits reversed0000000001010000000011011001100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000110011011000000001010000000001at 64 bits, wrapping
Shifted left by 1-111001100100111111110110000000000= -7,728,000,000, no wrap
Shifted right by 1-1110011001001111111101100000000= -1,932,000,000, discarding the low bit
These bits as a double1.90906966 × 10^-314IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+3,864,000,002
Nearest square below3,863,989,921
Nearest square above3,864,114,244

Powers & multiples

-3,864,000,000 to the power 214,930,496,000,000,000,000
-3,864,000,000 to the power 3-57,691,436,544,000,000,000,000,000,000
-3,864,000,000 to the power 4222,919,710,806,016,000,000,000,000,000,000,000,000
-3,864,000,000 to the power 5-86136176255444582400000000000… (49 digits)
First ten multiples-3,864,000,000, -7,728,000,000, -11,592,000,000, -15,456,000,000, -19,320,000,000, -23,184,000,000, -27,048,000,000, -30,912,000,000, -34,776,000,000, -38,640,000,000
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 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10Yes
Divisible by 11No, remainder 3
Divisible by 12Yes
Divisible by 100Yes

As a percentage & fraction

As a percentage-386,400,000,000%
-3,864,000,000% as a decimal-38,640,000
-3,864,000,000% of 100-3,864,000,000
-3,864,000,000% of 1,000-38,640,000,000
As a fraction of 100-3,864,000,000/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Also reads as

3864000000 (identifier)

  • 10 characters
  • Checksum fails

3864000000 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.

Open this reading on its own page →

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

Every value on this page was computed from “-3864000000” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.