Recognised as Number
-1,999,838,001
- Negative
- Odd
- 10 digits
-1,999,838,001 is an odd 10-digit integer and the negative of 1,999,838,001. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value1,999,838,001
Digit count10
Digit sum48
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 × 7 × 443 × 214,967
Distinct prime factors43, 7, 443, 214,967
Number of divisors16
Sum of divisors σ(n)3,054,265,344
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 443, 1,329, 3,101, 9,303, 214,967, 644,901, 1,504,769, 4,514,307, 95,230,381, 285,691,143, 666,612,667, 1,999,838,00116 in total
Arithmetic
Previous number-1,999,838,002
Next number-1,999,838,000
Double-3,999,676,002
Half-999,919,000.5
Square3,999,352,030,243,676,001
Cube-7,998,056,169,457,804,556,731,514,001
Cube root-1,259.887031318≈
Negation1,999,838,001
Reciprocal-5.00040503 × 10^-10≈
Representations
Decimal-1,999,838,001
Binary111011100110011000110110011000131 bits
Octal16714615461
Hexadecimal77331B31
Base 36X2NGVL
In wordsminus one billion, nine hundred and ninety-nine million, eight hundred and thirty-eight thousand and one
Ordinalminus one billion, nine hundred and ninety-nine million, eight hundred and thirty-eight thousand and first
Scientific notation-1.999838 × 10^9
Engineering notation-1.999838 × 10^9
In other bases
Ternary12011101001022000010base 3; the most digit-efficient integer base after e: 20 digits
Quinary13043424304001base 5; one hand: 14 digits
Septenary100362225330base 7: 12 digits
Nonary5141038003base 9; each digit is two ternary digits: 10 digits
Duodecimal4798a97a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal1b4ijf01base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal2:34:18:30:33:21base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT110TTT0T00TT010000T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011001110111010010010111010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
10001000110011001110010011001111
Bit length31 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits14within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 30worth 1,073,741,824
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes477 33 1b 31
Gray code1001100101010101001011010101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit10001000110011001110010011001111two's complement
64-bit1111111111111111111111111111111110001000110011001110010011001111two's complement
One's complement01110111001100110001101100110000at 32 bits, every bit flipped
Bits reversed11110011001001110011001100010001at 32 bits
Rotated left by 100010001100110011100100110011111at 32 bits, wrapping
Shifted left by 1-11101110011001100011011001100010= -3,999,676,002, no wrap
Shifted right by 1-111011100110011000110110011001= -999,919,000, discarding the low bit
These bits as a double9.88051254 × 10^-315≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-1,999,838,001 to the power 23,999,352,030,243,676,001
-1,999,838,001 to the power 3-7,998,056,169,457,804,556,731,514,001
-1,999,838,001 to the power 415,994,816,661,814,213,118,582,642,053,463,352,001
-1,999,838,001 to the power 5-31987042179324028996454286837… (48 digits)
First ten multiples-1,999,838,001, -3,999,676,002, -5,999,514,003, -7,999,352,004, -9,999,190,005, -11,999,028,006, -13,998,866,007, -15,998,704,008, -17,998,542,009, -19,998,380,010
Powers of twoBetween 2^30 (1,073,741,824) and 2^31 (2,147,483,648)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-199,983,800,100%
-1,999,838,001% as a decimal-19,998,380.01
-1,999,838,001% of 100-1,999,838,001
-1,999,838,001% of 1,000-19,998,380,010
As a fraction of 100-1,999,838,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,999,838,001
Also reads as
1999838001 (identifier)
- 10 characters
- Checksum fails
1999838001 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