Recognised as Number
-19,995,197,616,801
- Negative
- Odd
- Perfect square
- 14 digits
-19,995,197,616,801 is an odd 14-digit integer and the negative of 19,995,197,616,801. It has 81 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value19,995,197,616,801
Digit count14
Digit sum72
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 4,471,599²
Factors & divisors
Prime factorisation−1 × 3^2 × 11^2 × 179^2 × 757^2
Distinct prime factors43, 11, 179, 757
Number of divisors81
Sum of divisors σ(n)31,966,850,514,963
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 11, 33, 99, 121, 179, 363, 537, 757, 1,089, 1,611, 1,969, 2,271, 5,907, 6,813, 8,327, 17,721, 21,659, 24,981, 32,041, 64,977, 74,943, 91,597, 96,123, 135,503, 194,931, 274,791, 288,369, 352,451, 406,509, 573,049, 824,373, 1,057,353, 1,219,527, 1,490,533, 1,719,147, 3,172,059, 3,876,961, 4,471,599, 5,157,441, 6,303,539, 11,630,883, 13,414,797, 16,395,863, 18,910,617, 24,255,037, 34,892,649, 49,187,589, 56,731,851, 69,338,929, 72,765,111, 102,575,771, 147,562,767, 208,016,787, 218,295,333, 266,805,407, 307,727,313, 624,050,361, 800,416,221, 923,181,939, 1,128,333,481, 2,401,248,663, 2,934,859,477, 3,385,000,443, 8,804,578,431, 10,155,001,329, 12,411,668,291, 18,361,063,009, 26,413,735,293, 37,235,004,873, 55,083,189,027, 111,705,014,619, 165,249,567,081, 201,971,693,099, 605,915,079,297, 1,817,745,237,891, 2,221,688,624,089, 6,665,065,872,267, 19,995,197,616,80181 in total
Arithmetic
Previous number-19,995,197,616,802
Next number-19,995,197,616,800
Double-39,990,395,233,602
Square399,807,927,734,924,390,037,473,601
Cube-7,994,238,523,823,506,593,733,220,733,798,151,570,401
Cube root-27,142.003379771≈
Negation19,995,197,616,801
Reciprocal-5.00120088 × 10^-14≈
Representations
Decimal-19,995,197,616,801
Binary10010001011110111111010100110101100101010000145 bits
Octal442757651531241
Hexadecimal122F7EA6B2A1
Base 36735O0EEU9
In wordsminus nineteen trillion, nine hundred and ninety-five billion, one hundred and ninety-seven million, six hundred and sixteen thousand, eight hundred and one
Ordinalminus nineteen trillion, nine hundred and ninety-five billion, one hundred and ninety-seven million, six hundred and sixteen thousand, eight hundred and first
Scientific notation-1.99951976 × 10^13
Engineering notation-19.995198 × 10^12
In other bases
Ternary2121210112002200221011101100base 3; the most digit-efficient integer base after e: 28 digits
Quinary10110100131042214201base 5; one hand: 20 digits
Septenary4132414431314451base 7: 16 digits
Nonary77715080834340base 9; each digit is two ternary digits: 14 digits
Duodecimal22ab253285169base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal1j114j52201base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal7:8:33:59:19:20:13:21base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT01011TT1110T010T01T0TTT0TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100101101000110000110101010010101001010100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111011011101000010000001010110010100110101011111
Bit length45 bitsto write the magnitude
Set bits24the population count, or Hamming weight
Zero bits21within that length
Bit parityeven24 set bits, so even; not the same as the number itself being odd
Highest set bitbit 44worth 17,592,186,044,416
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes612 2f 7e a6 b2 a1
Gray code110110011100011000001111101011110101111110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111011011101000010000001010110010100110101011111two's complement
One's complement0000000000000000000100100010111101111110101001101011001010100000at 64 bits, every bit flipped
Bits reversed1111101010110010100110101000000100001011101101111111111111111111at 64 bits
Rotated left by 11111111111111111110110111010000100000010101100101001101010111111at 64 bits, wrapping
Shifted left by 1-1001000101111011111101010011010110010101000010= -39,990,395,233,602, no wrap
Shifted right by 1-10010001011110111111010100110101100101010001= -9,997,598,808,400, discarding the low bit
These bits as a double9.87894022 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below19,995,197,616,801
Nearest square above19,995,206,560,000
Powers & multiples
-19,995,197,616,801 to the power 2399,807,927,734,924,390,037,473,601
-19,995,197,616,801 to the power 3-79942385238235065937332207337… (41 digits)
-19,995,197,616,801 to the power 4159846379079694523305357404538… (54 digits)
-19,995,197,616,801 to the power 5-31961599380285771560463741284… (68 digits)
First ten multiples-19,995,197,616,801, -39,990,395,233,602, -59,985,592,850,403, -79,980,790,467,204, -99,975,988,084,005, -119,971,185,700,806, -139,966,383,317,607, -159,961,580,934,408, -179,956,778,551,209, -199,951,976,168,010
Powers of twoBetween 2^44 (17,592,186,044,416) and 2^45 (35,184,372,088,832)
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 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-1.99951976 × 10^15%
-19,995,197,616,801% as a decimal-199,951,976,168.01
-19,995,197,616,801% of 100-19,995,197,616,801
-19,995,197,616,801% of 1,000-199,951,976,168,010
As a fraction of 100-19,995,197,616,801/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -19,995,197,616,801
Also reads as
19995197616801 (identifier)
- 14 characters
- Checksum fails
19995197616801 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). 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
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-14 (case/carton)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
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