Nerdulator> put something in

Recognised as Number

-3,760,000,004

  • Negative
  • Even
  • 10 digits

-3,760,000,004 is an even 10-digit integer and the negative of 3,760,000,004. It has 12 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value3,760,000,004
Digit count10
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2^2 × 563 × 1,669,627
Distinct prime factors32, 563, 1,669,627
Number of divisors12
Sum of divisors σ(n)6,591,691,344
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 563, 1,126, 2,252, 1,669,627, 3,339,254, 6,678,508, 940,000,001, 1,880,000,002, 3,760,000,00412 in total

Arithmetic

Previous number-3,760,000,005
Next number-3,760,000,003
Square14,137,600,030,080,000,016
Cube-53,157,376,169,651,200,180,480,000,064
Cube root-1,554.99602002
Reciprocal-2.65957447 × 10^-10

Representations

Decimal-3,760,000,004
Binary1110000000011101000011000000010032 bits
Octal34007206004
HexadecimalE01D0C04
Base 361Q6LUKK
In wordsminus three billion, seven hundred and sixty million and four
Ordinalminus three billion, seven hundred and sixty million and fourth
Scientific notation-3.76 × 10^9
Engineering notation-3.76 × 10^9

In other bases

Ternary100201001002210100102base 3; the most digit-efficient integer base after e: 21 digits
Quinary30200030000004base 5; one hand: 14 digits
Septenary162114321065base 7: 12 digits
Nonary10631083312base 9; each digit is two ternary digits: 11 digits
Duodecimal88b271b18base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal2if00004base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal4:50:7:24:26:44base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0T10T00T0T01T0T00TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100000001001110011010000001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111111111111111111111111111100011111111000101111001111111100
Bit length32 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits22within that length
Bit parityeven10 set bits, so even; 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
Bytes4e0 1d 0c 04
Gray code10010000000100111000101000000110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit1111111111111111111111111111111100011111111000101111001111111100two's complement
One's complement0000000000000000000000000000000011100000000111010000110000000011at 64 bits, every bit flipped
Bits reversed0011111111001111010001111111100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000111111110001011110011111111001at 64 bits, wrapping
Shifted left by 1-111000000001110100001100000001000= -7,520,000,008, no wrap
Shifted right by 1-1110000000011101000011000000010= -1,880,000,002, discarding the low bit
These bits as a double1.85768683 × 10^-314IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+3,760,000,006
Nearest square below3,759,897,124
Nearest square above3,760,019,761

Powers & multiples

-3,760,000,004 to the power 214,137,600,030,080,000,016
-3,760,000,004 to the power 3-53,157,376,169,651,200,180,480,000,064
-3,760,000,004 to the power 4199,871,734,610,518,017,357,209,600,962,560,000,256
-3,760,000,004 to the power 5-75151772293503468370518016904… (49 digits)
First ten multiples-3,760,000,004, -7,520,000,008, -11,280,000,012, -15,040,000,016, -18,800,000,020, -22,560,000,024, -26,320,000,028, -30,080,000,032, -33,840,000,036, -37,600,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 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 4
Divisible by 11No, remainder 2
Divisible by 12No, remainder 8
Divisible by 100No, remainder 4

As a percentage & fraction

As a percentage-376,000,000,400%
-3,760,000,004% as a decimal-37,600,000.04
-3,760,000,004% of 100-3,760,000,004
-3,760,000,004% of 1,000-37,600,000,040
As a fraction of 100-3,760,000,004/100

Keep nerding

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

Also reads as

3760000004 (identifier)

  • 10 characters
  • Checksum valid

3760000004 matches the shape of ISBN-10, Luhn (cards, IMEI). The check digit is valid for Luhn (cards, IMEI). 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 validmod 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 “-3760000004” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.