Recognised as Number
-3,760,000,005
- Negative
- Odd
- 10 digits
-3,760,000,005 is an odd 10-digit integer and the negative of 3,760,000,005. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value3,760,000,005
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 × 3 × 5 × 7,207 × 34,781
Distinct prime factors43, 5, 7,207, 34,781
Number of divisors16
Sum of divisors σ(n)6,017,007,744
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 7,207, 21,621, 34,781, 36,035, 104,343, 108,105, 173,905, 521,715, 250,666,667, 752,000,001, 1,253,333,335, 3,760,000,00516 in total
Arithmetic
Previous number-3,760,000,006
Next number-3,760,000,004
Double-7,520,000,010
Half-1,880,000,002.5
Square14,137,600,037,600,000,025
Cube-53,157,376,212,064,000,282,000,000,125
Cube root-1,554.996020158≈
Negation3,760,000,005
Reciprocal-2.65957446 × 10^-10≈
Representations
Decimal-3,760,000,005
Binary1110000000011101000011000000010132 bits
Octal34007206005
HexadecimalE01D0C05
Base 361Q6LUKL
In wordsminus three billion, seven hundred and sixty million and five
Ordinalminus three billion, seven hundred and sixty million and fifth
Scientific notation-3.76000001 × 10^9
Engineering notation-3.76 × 10^9
In other bases
Ternary100201001002210100110base 3; the most digit-efficient integer base after e: 21 digits
Quinary30200030000010base 5; one hand: 14 digits
Septenary162114321066base 7: 12 digits
Nonary10631083313base 9; each digit is two ternary digits: 11 digits
Duodecimal88b271b19base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal2if00005base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal4:50:7:24:26:45base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0T10T00T0T01T0T00TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100000001001110011010000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111100011111111000101111001111111011
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 05
Gray code10010000000100111000101000000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111100011111111000101111001111111011two's complement
One's complement0000000000000000000000000000000011100000000111010000110000000100at 64 bits, every bit flipped
Bits reversed1101111111001111010001111111100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000111111110001011110011111110111at 64 bits, wrapping
Shifted left by 1-111000000001110100001100000001010= -7,520,000,010, no wrap
Shifted right by 1-1110000000011101000011000000011= -1,880,000,002, 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,005 to the power 214,137,600,037,600,000,025
-3,760,000,005 to the power 3-53,157,376,212,064,000,282,000,000,125
-3,760,000,005 to the power 4199,871,734,823,147,522,120,640,001,880,000,000,625
-3,760,000,005 to the power 5-75151772393439335728934401767… (49 digits)
First ten multiples-3,760,000,005, -7,520,000,010, -11,280,000,015, -15,040,000,020, -18,800,000,025, -22,560,000,030, -26,320,000,035, -30,080,000,040, -33,840,000,045, -37,600,000,050
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 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 5
As a percentage & fraction
As a percentage-376,000,000,500%
-3,760,000,005% as a decimal-37,600,000.05
-3,760,000,005% of 100-3,760,000,005
-3,760,000,005% of 1,000-37,600,000,050
As a fraction of 100-3,760,000,005/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,005
Also reads as
3760000005 (identifier)
- 10 characters
- Checksum fails
3760000005 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