Recognised as Number
-81,831,293,498,375
- Negative
- Odd
- Perfect cube
- 14 digits
-81,831,293,498,375 is an odd 14-digit integer and the negative of 81,831,293,498,375. It has 64 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value81,831,293,498,375
Digit count14
Digit sum71
Digit product313,528,320
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -43,415³
Factors & divisors
Prime factorisation−1 × 5^3 × 19^3 × 457^3
Distinct prime factors35, 19, 457
Number of divisors64
Sum of divisors σ(n)108,034,663,152,000
SquarefreeNohas a repeated prime factor
All divisors1, 5, 19, 25, 95, 125, 361, 457, 475, 1,805, 2,285, 2,375, 6,859, 8,683, 9,025, 11,425, 34,295, 43,415, 45,125, 57,125, 164,977, 171,475, 208,849, 217,075, 824,885, 857,375, 1,044,245, 1,085,375, 3,134,563, 3,968,131, 4,124,425, 5,221,225, 15,672,815, 19,840,655, 20,622,125, 26,106,125, 75,394,489, 78,364,075, 95,443,993, 99,203,275, 376,972,445, 391,820,375, 477,219,965, 496,016,375, 1,432,495,291, 1,813,435,867, 1,884,862,225, 2,386,099,825, 7,162,476,455, 9,067,179,335, 9,424,311,125, 11,930,499,125, 34,455,281,473, 35,812,382,275, 45,335,896,675, 172,276,407,365, 179,061,911,375, 226,679,483,375, 654,650,347,987, 861,382,036,825, 3,273,251,739,935, 4,306,910,184,125, 16,366,258,699,675, 81,831,293,498,37564 in total
Arithmetic
Previous number-81,831,293,498,376
Next number-81,831,293,498,374
Double-163,662,586,996,750
Square6,696,360,595,617,190,546,127,640,625
Cube-547,971,849,270,903,547,257,718,313,809,441,021,484,375
Cube root-43,415
Negation81,831,293,498,375
Reciprocal-1.22202639 × 10^-14≈
Representations
Decimal-81,831,293,498,375
Binary1001010011011001101010100101110001101000000011147 bits
Octal2246632513432007
Hexadecimal4A6CD52E3407
Base 36T08RZBSHZ
In wordsminus eighty-one trillion, eight hundred and thirty-one billion, two hundred and ninety-three million, four hundred and ninety-eight thousand, three hundred and seventy-five
Ordinalminus eighty-one trillion, eight hundred and thirty-one billion, two hundred and ninety-three million, four hundred and ninety-eight thousand, three hundred and seventy-fifth
Scientific notation-8.18312935 × 10^13
Engineering notation-81.831293 × 10^12
In other bases
Ternary101201201222212112122121122222base 3; the most digit-efficient integer base after e: 30 digits
Quinary41211210442113422000base 5; one hand: 20 digits
Septenary23144054511041501base 7: 17 digits
Nonary351658775577588base 9; each digit is two ternary digits: 15 digits
Duodecimal921755275645bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal7jgadj475ifbase 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal29:13:55:43:1:0:39:35base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryTT11T11T1000010110100101100001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110010101001011101111111110101101101110000001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111101101011001001100101010110100011100101111111001
Bit length47 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits25within that length
Bit parityeven22 set bits, so even; not the same as the number itself being odd
Highest set bitbit 46worth 70,368,744,177,664
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes64a 6c d5 2e 34 07
Gray code11011110101101010111111101110010010111000000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111101101011001001100101010110100011100101111111001two's complement
One's complement0000000000000000010010100110110011010101001011100011010000000110at 64 bits, every bit flipped
Bits reversed1001111111010011100010110101010011001001101011011111111111111111at 64 bits
Rotated left by 11111111111111111011010110010011001010101101000111001011111110011at 64 bits, wrapping
Shifted left by 1-100101001101100110101010010111000110100000001110= -163,662,586,996,750, no wrap
Shifted right by 1-1001010011011001101010100101110001101000000100= -40,915,646,749,187, discarding the low bit
These bits as a double4.04300309 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below81,831,291,984,225
Nearest square above81,831,310,076,356
Powers & multiples
-81,831,293,498,375 to the power 26,696,360,595,617,190,546,127,640,625
-81,831,293,498,375 to the power 3-54797184927090354725771831380… (43 digits)
-81,831,293,498,375 to the power 4448412452265346149307722492133… (56 digits)
-81,831,293,498,375 to the power 5-36694170989651610388163873577… (71 digits)
First ten multiples-81,831,293,498,375, -163,662,586,996,750, -245,493,880,495,125, -327,325,173,993,500, -409,156,467,491,875, -490,987,760,990,250, -572,819,054,488,625, -654,650,347,987,000, -736,481,641,485,375, -818,312,934,983,750
Powers of twoBetween 2^46 (70,368,744,177,664) and 2^47 (140,737,488,355,328)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 75
As a percentage & fraction
As a percentage-8.18312935 × 10^15%
-81,831,293,498,375% as a decimal-818,312,934,983.75
-81,831,293,498,375% of 100-81,831,293,498,375
-81,831,293,498,375% of 1,000-818,312,934,983,750
As a fraction of 100-81,831,293,498,375/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -81,831,293,498,375
Also reads as
81831293498375 (identifier)
- 14 characters
- Checksum fails
81831293498375 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