Recognised as Number
-3,760,000,003
- Negative
- Odd
- 10 digits
-3,760,000,003 is an odd 10-digit integer and the negative of 3,760,000,003. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,760,000,003
Digit count10
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 19 × 23 × 8,604,119
Distinct prime factors319, 23, 8,604,119
Number of divisors8
Sum of divisors σ(n)4,129,977,600
SquarefreeYesno repeated prime factor
All divisors1, 19, 23, 437, 8,604,119, 163,478,261, 197,894,737, 3,760,000,0038 in total
Arithmetic
Previous number-3,760,000,004
Next number-3,760,000,002
Double-7,520,000,006
Half-1,880,000,001.5
Square14,137,600,022,560,000,009
Cube-53,157,376,127,238,400,101,520,000,027
Cube root-1,554.996019882≈
Negation3,760,000,003
Reciprocal-2.65957447 × 10^-10≈
Representations
Decimal-3,760,000,003
Binary1110000000011101000011000000001132 bits
Octal34007206003
HexadecimalE01D0C03
Base 361Q6LUKJ
In wordsminus three billion, seven hundred and sixty million and three
Ordinalminus three billion, seven hundred and sixty million and third
Scientific notation-3.76 × 10^9
Engineering notation-3.76 × 10^9
In other bases
Ternary100201001002210100101base 3; the most digit-efficient integer base after e: 21 digits
Quinary30200030000003base 5; one hand: 14 digits
Septenary162114321064base 7: 12 digits
Nonary10631083311base 9; each digit is two ternary digits: 11 digits
Duodecimal88b271b17base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal2if00003base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal4:50:7:24:26:43base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0T10T00T0T01T0T00T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100000001001110011010000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111100011111111000101111001111111101
Bit length32 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits21within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 31worth 2,147,483,648
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes4e0 1d 0c 03
Gray code10010000000100111000101000000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111100011111111000101111001111111101two's complement
One's complement0000000000000000000000000000000011100000000111010000110000000010at 64 bits, every bit flipped
Bits reversed1011111111001111010001111111100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000111111110001011110011111111011at 64 bits, wrapping
Shifted left by 1-111000000001110100001100000000110= -7,520,000,006, no wrap
Shifted right by 1-1110000000011101000011000000010= -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,003 to the power 214,137,600,022,560,000,009
-3,760,000,003 to the power 3-53,157,376,127,238,400,101,520,000,027
-3,760,000,003 to the power 4199,871,734,397,888,512,763,430,400,406,080,000,081
-3,760,000,003 to the power 5-75151772193567601118416384381… (49 digits)
First ten multiples-3,760,000,003, -7,520,000,006, -11,280,000,009, -15,040,000,012, -18,800,000,015, -22,560,000,018, -26,320,000,021, -30,080,000,024, -33,840,000,027, -37,600,000,030
Powers of twoBetween 2^31 (2,147,483,648) and 2^32 (4,294,967,296)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 3
As a percentage & fraction
As a percentage-376,000,000,300%
-3,760,000,003% as a decimal-37,600,000.03
-3,760,000,003% of 100-3,760,000,003
-3,760,000,003% of 1,000-37,600,000,030
As a fraction of 100-3,760,000,003/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,003
Also reads as
3760000003 (identifier)
- 10 characters
- Checksum fails
3760000003 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