Recognised as Number
-3,760,000,006
- Negative
- Even
- 10 digits
-3,760,000,006 is an even 10-digit integer and the negative of 3,760,000,006. It has 24 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value3,760,000,006
Digit count10
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 7^2 × 229 × 167,543
Distinct prime factors42, 7, 229, 167,543
Number of divisors24
Sum of divisors σ(n)6,589,505,520
SquarefreeNohas a repeated prime factor
All divisors1, 2, 7, 14, 49, 98, 229, 458, 1,603, 3,206, 11,221, 22,442, 167,543, 335,086, 1,172,801, 2,345,602, 8,209,607, 16,419,214, 38,367,347, 76,734,694, 268,571,429, 537,142,858, 1,880,000,003, 3,760,000,00624 in total
Arithmetic
Previous number-3,760,000,007
Next number-3,760,000,005
Double-7,520,000,012
Half-1,880,000,003
Square14,137,600,045,120,000,036
Cube-53,157,376,254,476,800,406,080,000,216
Cube root-1,554.996020296≈
Negation3,760,000,006
Reciprocal-2.65957446 × 10^-10≈
Representations
Decimal-3,760,000,006
Binary1110000000011101000011000000011032 bits
Octal34007206006
HexadecimalE01D0C06
Base 361Q6LUKM
In wordsminus three billion, seven hundred and sixty million and six
Ordinalminus three billion, seven hundred and sixty million and sixth
Scientific notation-3.76000001 × 10^9
Engineering notation-3.76 × 10^9
In other bases
Ternary100201001002210100111base 3; the most digit-efficient integer base after e: 21 digits
Quinary30200030000011base 5; one hand: 14 digits
Septenary162114321100base 7: 12 digits
Nonary10631083314base 9; each digit is two ternary digits: 11 digits
Duodecimal88b271b1abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal2if00006base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal4:50:7:24:26:46base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT0T10T00T0T01T0T00TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101100000001001110011010000001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111100011111111000101111001111111010
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 even
Highest set bitbit 31worth 2,147,483,648
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes4e0 1d 0c 06
Gray code10010000000100111000101000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111100011111111000101111001111111010two's complement
One's complement0000000000000000000000000000000011100000000111010000110000000101at 64 bits, every bit flipped
Bits reversed0101111111001111010001111111100011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111000111111110001011110011111110101at 64 bits, wrapping
Shifted left by 1-111000000001110100001100000001100= -7,520,000,012, no wrap
Shifted right by 1-1110000000011101000011000000011= -1,880,000,003, 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,006 to the power 214,137,600,045,120,000,036
-3,760,000,006 to the power 3-53,157,376,254,476,800,406,080,000,216
-3,760,000,006 to the power 4199,871,735,035,777,027,053,721,603,248,640,001,296
-3,760,000,006 to the power 5-75151772493375203193665539053… (49 digits)
First ten multiples-3,760,000,006, -7,520,000,012, -11,280,000,018, -15,040,000,024, -18,800,000,030, -22,560,000,036, -26,320,000,042, -30,080,000,048, -33,840,000,054, -37,600,000,060
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 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 4
Divisible by 12No, remainder 10
Divisible by 100No, remainder 6
As a percentage & fraction
As a percentage-376,000,000,600%
-3,760,000,006% as a decimal-37,600,000.06
-3,760,000,006% of 100-3,760,000,006
-3,760,000,006% of 1,000-37,600,000,060
As a fraction of 100-3,760,000,006/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,006
Also reads as
3760000006 (identifier)
- 10 characters
- Checksum fails
3760000006 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