Recognised as Number
-1,876,500,000,001
- Negative
- Odd
- 13 digits
-1,876,500,000,001 is an odd 13-digit integer and the negative of 1,876,500,000,001. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value1,876,500,000,001
Digit count13
Digit sum28
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 × 11 × 38,327 × 4,450,933
Distinct prime factors311, 38,327, 4,450,933
Number of divisors8
Sum of divisors σ(n)2,047,144,780,224
SquarefreeYesno repeated prime factor
All divisors1, 11, 38,327, 421,597, 4,450,933, 48,960,263, 170,590,909,091, 1,876,500,000,0018 in total
Arithmetic
Previous number-1,876,500,000,002
Next number-1,876,500,000,000
Double-3,753,000,000,002
Square3,521,252,250,003,753,000,000,001
Cube-6,607,629,847,135,563,756,750,005,629,500,000,001
Cube root-12,334.347777934≈
Negation1,876,500,000,001
Reciprocal-5.32907008 × 10^-13≈
Representations
Decimal-1,876,500,000,001
Binary1101101001110100000011101101011010000000141 bits
Octal33235007326401
Hexadecimal1B4E81DAD01
Base 36NY1VNEO1
In wordsminus one trillion, eight hundred and seventy-six billion, five hundred million and one
Ordinalminus one trillion, eight hundred and seventy-six billion, five hundred million and first
Scientific notation-1.8765 × 10^12
Engineering notation-1.8765 × 10^12
In other bases
Ternary20122101120111210211002001base 3; the most digit-efficient integer base after e: 26 digits
Quinary221221033000000001base 5; one hand: 18 digits
Septenary252400263553024base 7: 15 digits
Nonary6571514724061base 9; each digit is two ternary digits: 13 digits
Duodecimal263818078001base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal3d60650001base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal40:13:11:40:0:0:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryT1T101TT111T1111TT1TT0T100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101111101101000001001100101011100000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111100100101100010111111000100101001011111111
Bit length41 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits22within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 40worth 1,099,511,627,776
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes601 b4 e8 1d ad 01
Gray code10110111010011100000100110111101110000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111100100101100010111111000100101001011111111two's complement
One's complement0000000000000000000000011011010011101000000111011010110100000000at 64 bits, every bit flipped
Bits reversed1111111101001010010001111110100011010010011111111111111111111111at 64 bits
Rotated left by 11111111111111111111111001001011000101111110001001010010111111111at 64 bits, wrapping
Shifted left by 1-110110100111010000001110110101101000000010= -3,753,000,000,002, no wrap
Shifted right by 1-1101101001110100000011101101011010000001= -938,250,000,000, discarding the low bit
These bits as a double9.27114184 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below1,876,499,981,316
Nearest square above1,876,502,721,025
Powers & multiples
-1,876,500,000,001 to the power 23,521,252,250,003,753,000,000,001
-1,876,500,000,001 to the power 3-6,607,629,847,135,563,756,750,005,629,500,000,001
-1,876,500,000,001 to the power 4123992174081564930193885211275… (50 digits)
-1,876,500,000,001 to the power 5-23267131466418058368290716388… (63 digits)
First ten multiples-1,876,500,000,001, -3,753,000,000,002, -5,629,500,000,003, -7,506,000,000,004, -9,382,500,000,005, -11,259,000,000,006, -13,135,500,000,007, -15,012,000,000,008, -16,888,500,000,009, -18,765,000,000,010
Powers of twoBetween 2^40 (1,099,511,627,776) and 2^41 (2,199,023,255,552)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-187,650,000,000,100%
-1,876,500,000,001% as a decimal-18,765,000,000.01
-1,876,500,000,001% of 100-1,876,500,000,001
-1,876,500,000,001% of 1,000-18,765,000,000,010
As a fraction of 100-1,876,500,000,001/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -1,876,500,000,001
Also reads as
1876500000001 (identifier)
- 13 characters
- Checksum fails
1876500000001 matches the shape of ISBN-13 / EAN-13, 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-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
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