Recognised as Number
-116,304,189,157
- Negative
- Odd
- 12 digits
-116,304,189,157 is an odd 12-digit integer and the negative of 116,304,189,157. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value116,304,189,157
Digit count12
Digit sum46
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 × 13 × 6,221 × 1,438,109
Distinct prime factors313, 6,221, 1,438,109
Number of divisors8
Sum of divisors σ(n)125,270,885,880
SquarefreeYesno repeated prime factor
All divisors1, 13, 6,221, 80,873, 1,438,109, 18,695,417, 8,946,476,089, 116,304,189,1578 in total
Arithmetic
Previous number-116,304,189,158
Next number-116,304,189,156
Double-232,608,378,314
Square13,526,664,415,467,236,370,649
Cube-1,573,207,736,839,762,295,387,991,458,852,893
Cube root-4,881.258257984≈
Negation116,304,189,157
Reciprocal-8.59814257 × 10^-12≈
Representations
Decimal-116,304,189,157
Binary110110001010001000101000101101110010137 bits
Octal1542421213345
Hexadecimal1B144516E5
Base 361HFGIEP1
In wordsminus one hundred and sixteen billion, three hundred and four million, one hundred and eighty-nine thousand, one hundred and fifty-seven
Ordinalminus one hundred and sixteen billion, three hundred and four million, one hundred and eighty-nine thousand, one hundred and fifty-seventh
Scientific notation-1.16304189 × 10^11
Engineering notation-116.304189 × 10^9
In other bases
Ternary102010012102211222010101base 3; the most digit-efficient integer base after e: 24 digits
Quinary3401142333023112base 5; one hand: 16 digits
Septenary11255061203452base 7: 14 digits
Nonary363172758111base 9; each digit is two ternary digits: 12 digits
Duodecimal1a65a055031base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal4ah513chhbase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal2:29:34:5:19:12:37base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryTT10T0T11TT00110010T0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100111100110011110011100101101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111110010011101011101110101110100100011011
Bit length37 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits20within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 36worth 68,719,476,736
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes51b 14 45 16 e5
Gray code1011010011110011001111001110110010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111110010011101011101110101110100100011011two's complement
One's complement0000000000000000000000000001101100010100010001010001011011100100at 64 bits, every bit flipped
Bits reversed1101100010010111010111011101011100100111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111100100111010111011101011101001000110111at 64 bits, wrapping
Shifted left by 1-11011000101000100010100010110111001010= -232,608,378,314, no wrap
Shifted right by 1-110110001010001000101000101101110011= -58,152,094,578, discarding the low bit
These bits as a double5.74619043 × 10^-313≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-116,304,189,157 to the power 213,526,664,415,467,236,370,649
-116,304,189,157 to the power 3-1,573,207,736,839,762,295,387,991,458,852,893
-116,304,189,157 to the power 4182970650208667591401721467336… (45 digits)
-116,304,189,157 to the power 5-21280253112048157071321400312… (57 digits)
First ten multiples-116,304,189,157, -232,608,378,314, -348,912,567,471, -465,216,756,628, -581,520,945,785, -697,825,134,942, -814,129,324,099, -930,433,513,256, -1,046,737,702,413, -1,163,041,891,570
Powers of twoBetween 2^36 (68,719,476,736) and 2^37 (137,438,953,472)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-11,630,418,915,700%
-116,304,189,157% as a decimal-1,163,041,891.57
-116,304,189,157% of 100-116,304,189,157
-116,304,189,157% of 1,000-1,163,041,891,570
As a fraction of 100-116,304,189,157/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -116,304,189,157
Also reads as
116304189157 (identifier)
- 12 characters
- Checksum valid
116304189157 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for GTIN-12 (UPC-A). 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-12 (UPC-A)Check digit validGS1 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