Recognised as Number
-3,760,000,002
- Negative
- Even
- 10 digits
-3,760,000,002 is an even 10-digit integer and the negative of 3,760,000,002. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value3,760,000,002
Digit count10
Digit sum18
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 × 11 × 18,989,899
Distinct prime factors42, 3, 11, 18,989,899
Number of divisors24
Sum of divisors σ(n)8,887,273,200
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 99, 198, 18,989,899, 37,979,798, 56,969,697, 113,939,394, 170,909,091, 208,888,889, 341,818,182, 417,777,778, 626,666,667, 1,253,333,334, 1,880,000,001, 3,760,000,00224 in total
Arithmetic
Previous number-3,760,000,003
Next number-3,760,000,001
Double-7,520,000,004
Half-1,880,000,001
Square14,137,600,015,040,000,004
Cube-53,157,376,084,825,600,045,120,000,008
Cube root-1,554.996019744≈
Negation3,760,000,002
Reciprocal-2.65957447 × 10^-10≈
Representations
Decimal-3,760,000,002
Binary1110000000011101000011000000001032 bits
Octal34007206002
HexadecimalE01D0C02
Base 361Q6LUKI
In wordsminus three billion, seven hundred and sixty million and two
Ordinalminus three billion, seven hundred and sixty million and second
Scientific notation-3.76 × 10^9
Engineering notation-3.76 × 10^9
In other bases
Ternary100201001002210100100base 3; the most digit-efficient integer base after e: 21 digits
Quinary30200030000002base 5; one hand: 14 digits
Septenary162114321063base 7: 12 digits
Nonary10631083310base 9; each digit is two ternary digits: 11 digits
Duodecimal88b271b16base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal2if00002base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal4:50:7:24:26:42base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0T10T00T0T01T0T00T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100000001001110011010000000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111100011111111000101111001111111110
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 11 trailing zero
Power of twoNo
Bytes4e0 1d 0c 02
Gray code10010000000100111000101000000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111100011111111000101111001111111110two's complement
One's complement0000000000000000000000000000000011100000000111010000110000000001at 64 bits, every bit flipped
Bits reversed0111111111001111010001111111100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000111111110001011110011111111101at 64 bits, wrapping
Shifted left by 1-111000000001110100001100000000100= -7,520,000,004, no wrap
Shifted right by 1-1110000000011101000011000000001= -1,880,000,001, discarding the low bit
These bits as a double1.85768683 × 10^-314≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-3,760,000,002 to the power 214,137,600,015,040,000,004
-3,760,000,002 to the power 3-53,157,376,084,825,600,045,120,000,008
-3,760,000,002 to the power 4199,871,734,185,259,008,339,302,400,120,320,000,016
-3,760,000,002 to the power 5-75151772093631733972629504113… (49 digits)
First ten multiples-3,760,000,002, -7,520,000,004, -11,280,000,006, -15,040,000,008, -18,800,000,010, -22,560,000,012, -26,320,000,014, -30,080,000,016, -33,840,000,018, -37,600,000,020
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 2
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 6
Divisible by 100No, remainder 2
As a percentage & fraction
As a percentage-376,000,000,200%
-3,760,000,002% as a decimal-37,600,000.02
-3,760,000,002% of 100-3,760,000,002
-3,760,000,002% of 1,000-37,600,000,020
As a fraction of 100-3,760,000,002/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,760,000,002
Also reads as
3760000002 (identifier)
- 10 characters
- Checksum valid
3760000002 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-139783760000008the 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