Recognised as Number
-1,641,999,998
- Negative
- Even
- 10 digits
-1,641,999,998 is an even 10-digit integer and the negative of 1,641,999,998. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value1,641,999,998
Digit count10
Digit sum65
Digit product11,337,408
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 241 × 263 × 12,953
Distinct prime factors42, 241, 263, 12,953
Number of divisors16
Sum of divisors σ(n)2,482,815,456
SquarefreeYesno repeated prime factor
All divisors1, 2, 241, 263, 482, 526, 12,953, 25,906, 63,383, 126,766, 3,121,673, 3,406,639, 6,243,346, 6,813,278, 820,999,999, 1,641,999,99816 in total
Arithmetic
Previous number-1,641,999,999
Next number-1,641,999,997
Double-3,283,999,996
Half-820,999,999
Square2,696,163,993,432,000,004
Cube-4,427,101,271,823,016,019,703,999,992
Cube root-1,179.752892333≈
Negation1,641,999,998
Reciprocal-6.09013399 × 10^-10≈
Representations
Decimal-1,641,999,998
Binary110000111011110111011100111111031 bits
Octal14167567176
Hexadecimal61DEEE7E
Base 36R5LRB2
In wordsminus one billion, six hundred and forty-one million, nine hundred and ninety-nine thousand, nine hundred and ninety-eight
Ordinalminus one billion, six hundred and forty-one million, nine hundred and ninety-nine thousand, nine hundred and ninety-eighth
Scientific notation-1.642 × 10^9
Engineering notation-1.642 × 10^9
In other bases
Ternary11020102201020112202base 3; the most digit-efficient integer base after e: 20 digits
Quinary11330322444443base 5; one hand: 14 digits
Septenary55455525002base 7: 11 digits
Nonary4212636482base 9; each digit is two ternary digits: 10 digits
Duodecimal399a9b592base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal15d29jjibase 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal2:6:41:51:6:38base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryTTT10TT010TT1T1101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100010011000010001011010000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
10011110001000010001000110000010
Bit length31 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits10within that length
Bit parityodd21 set bits, so odd; not the same as the number itself being even
Highest set bitbit 30worth 1,073,741,824
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes461 de ee 7e
Gray code1010001001100011001100101000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit10011110001000010001000110000010two's complement
64-bit1111111111111111111111111111111110011110001000010001000110000010two's complement
One's complement01100001110111101110111001111101at 32 bits, every bit flipped
Bits reversed01000001100010001000010001111001at 32 bits
Rotated left by 100111100010000100010001100000101at 32 bits, wrapping
Shifted left by 1-11000011101111011101110011111100= -3,283,999,996, no wrap
Shifted right by 1-110000111011110111011100111111= -820,999,999, discarding the low bit
These bits as a double8.11255789 × 10^-315≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-1,641,999,998 to the power 22,696,163,993,432,000,004
-1,641,999,998 to the power 3-4,427,101,271,823,016,019,703,999,992
-1,641,999,998 to the power 47,269,300,279,479,189,760,707,935,947,456,000,016
-1,641,999,998 to the power 5-11936191044366229028124051304… (48 digits)
First ten multiples-1,641,999,998, -3,283,999,996, -4,925,999,994, -6,567,999,992, -8,209,999,990, -9,851,999,988, -11,493,999,986, -13,135,999,984, -14,777,999,982, -16,419,999,980
Powers of twoBetween 2^30 (1,073,741,824) and 2^31 (2,147,483,648)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 1
Divisible by 12No, remainder 2
Divisible by 100No, remainder 98
As a percentage & fraction
As a percentage-164,199,999,800%
-1,641,999,998% as a decimal-16,419,999.98
-1,641,999,998% of 100-1,641,999,998
-1,641,999,998% of 1,000-16,419,999,980
As a fraction of 100-1,641,999,998/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,641,999,998
Also reads as
1641999998 (identifier)
- 10 characters
- Checksum valid
1641999998 matches the shape of ISBN-10, Luhn (cards, IMEI). The check digit is valid for Luhn (cards, IMEI). 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 validmod 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