Recognised as Number
-113,164,960,002
- Negative
- Even
- 12 digits
-113,164,960,002 is an even 12-digit integer and the negative of 113,164,960,002. It has 8 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value113,164,960,002
Digit count12
Digit sum33
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3 × 18,860,826,667
Distinct prime factors32, 3, 18,860,826,667
Number of divisors8
Sum of divisors σ(n)226,329,920,016
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 18,860,826,667, 37,721,653,334, 56,582,480,001, 113,164,960,0028 in total
Arithmetic
Previous number-113,164,960,003
Next number-113,164,960,001
Double-226,329,920,004
Half-56,582,480,001
Square12,806,308,172,254,259,840,004
Cube-1,449,225,352,086,439,040,968,167,579,520,008
Cube root-4,836.939530962≈
Negation113,164,960,002
Reciprocal-8.83665757 × 10^-12≈
Representations
Decimal-113,164,960,002
Binary110100101100100101000010000010000001037 bits
Octal1513112040402
Hexadecimal1A59284102
Base 361FZJHTZ6
In wordsminus one hundred and thirteen billion, one hundred and sixty-four million, nine hundred and sixty thousand and two
Ordinalminus one hundred and thirteen billion, one hundred and sixty-four million, nine hundred and sixty thousand and second
Scientific notation-1.1316496 × 10^11
Engineering notation-113.16496 × 10^9
In other bases
Ternary101211002122211121021220base 3; the most digit-efficient integer base after e: 24 digits
Quinary3323230212210002base 5; one hand: 16 digits
Septenary11114222201043base 7: 14 digits
Nonary354078747256base 9; each digit is two ternary digits: 12 digits
Duodecimal19b22871596base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal488410002base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal2:25:31:51:51:6:42base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryTT11TT0T010001111TT01010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011111011001010001100001100000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111110010110100110110101111011111011111110
Bit length37 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits25within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 36worth 68,719,476,736
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes51a 59 28 41 02
Gray code1011101110101101111000110000110000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111110010110100110110101111011111011111110two's complement
One's complement0000000000000000000000000001101001011001001010000100000100000001at 64 bits, every bit flipped
Bits reversed0111111101111101111010110110010110100111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111100101101001101101011110111110111111101at 64 bits, wrapping
Shifted left by 1-11010010110010010100001000001000000100= -226,329,920,004, no wrap
Shifted right by 1-110100101100100101000010000010000001= -56,582,480,001, discarding the low bit
These bits as a double5.5910919 × 10^-313≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-113,164,960,002 to the power 212,806,308,172,254,259,840,004
-113,164,960,002 to the power 3-1,449,225,352,086,439,040,968,167,579,520,008
-113,164,960,002 to the power 4164001529002746241317773923491… (45 digits)
-113,164,960,002 to the power 5-18559226469862621346881725823… (57 digits)
First ten multiples-113,164,960,002, -226,329,920,004, -339,494,880,006, -452,659,840,008, -565,824,800,010, -678,989,760,012, -792,154,720,014, -905,319,680,016, -1,018,484,640,018, -1,131,649,600,020
Powers of twoBetween 2^36 (68,719,476,736) and 2^37 (137,438,953,472)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 6
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 6
Divisible by 100No, remainder 2
As a percentage & fraction
As a percentage-11,316,496,000,200%
-113,164,960,002% as a decimal-1,131,649,600.02
-113,164,960,002% of 100-113,164,960,002
-113,164,960,002% of 1,000-1,131,649,600,020
As a fraction of 100-113,164,960,002/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -113,164,960,002
Also reads as
113164960002 (identifier)
- 12 characters
- Checksum fails
113164960002 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). 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-12 (UPC-A)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