Recognised as Number
-61,316,796,395,737
- Negative
- Odd
- Perfect cube
- 14 digits
-61,316,796,395,737 is an odd 14-digit integer and the negative of 61,316,796,395,737. It has 16 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value61,316,796,395,737
Digit count14
Digit sum73
Digit product810,152,280
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -39,433³
Factors & divisors
Prime factorisation−1 × 47^3 × 839^3
Distinct prime factors247, 839
Number of divisors16
Sum of divisors σ(n)62,724,518,438,400
SquarefreeNohas a repeated prime factor
All divisors1, 47, 839, 2,209, 39,433, 103,823, 703,921, 1,853,351, 33,084,287, 87,107,497, 590,589,719, 1,554,961,489, 27,757,716,793, 73,083,189,983, 1,304,612,689,271, 61,316,796,395,73716 in total
Arithmetic
Previous number-61,316,796,395,738
Next number-61,316,796,395,736
Double-122,633,592,791,474
Square3,759,749,520,236,265,953,911,773,169
Cube-230,535,795,831,296,987,187,492,777,205,029,902,580,553
Cube root-39,433
Negation61,316,796,395,737
Reciprocal-1.63087451 × 10^-14≈
Representations
Decimal-61,316,796,395,737
Binary110111110001000110110111011110001100001101100146 bits
Octal1574215567430331
Hexadecimal37C46DDE30D9
Base 36LQGJPF5Y1
In wordsminus sixty-one trillion, three hundred and sixteen billion, seven hundred and ninety-six million, three hundred and ninety-five thousand, seven hundred and thirty-seven
Ordinalminus sixty-one trillion, three hundred and sixteen billion, seven hundred and ninety-six million, three hundred and ninety-five thousand, seven hundred and thirty-seventh
Scientific notation-6.13167964 × 10^13
Engineering notation-61.316796 × 10^12
In other bases
Ternary22001002211100222010021120101base 3; the most digit-efficient integer base after e: 29 digits
Quinary31014103244334130422base 5; one hand: 20 digits
Septenary15625664242552651base 7: 17 digits
Nonary261084328107511base 9; each digit is two ternary digits: 15 digits
Duodecimal6a63733071561base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal5jf3eih996hbase 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal21:54:13:54:17:23:15:37base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryT0100T0T01TTT0T0010T0T01110T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110110000100110010010110011001101101001101111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111110010000011101110010010001000011100111100100111
Bit length46 bitsto write the magnitude
Set bits26the population count, or Hamming weight
Zero bits20within that length
Bit parityeven26 set bits, so even; not the same as the number itself being odd
Highest set bitbit 45worth 35,184,372,088,832
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes637 c4 6d de 30 d9
Gray code1011000010011001011011001100010010100010110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111110010000011101110010010001000011100111100100111two's complement
One's complement0000000000000000001101111100010001101101110111100011000011011000at 64 bits, every bit flipped
Bits reversed1110010011110011100001000100100111011100000100111111111111111111at 64 bits
Rotated left by 11111111111111111100100000111011100100100010000111001111001001111at 64 bits, wrapping
Shifted left by 1-11011111000100011011011101111000110000110110010= -122,633,592,791,474, no wrap
Shifted right by 1-110111110001000110110111011110001100001101101= -30,658,398,197,868, discarding the low bit
These bits as a double3.02945226 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below61,316,792,894,016
Nearest square above61,316,808,555,025
Powers & multiples
-61,316,796,395,737 to the power 23,759,749,520,236,265,953,911,773,169
-61,316,796,395,737 to the power 3-23053579583129698718749277720… (43 digits)
-61,316,796,395,737 to the power 4141357164549168320136800841899… (56 digits)
-61,316,796,395,737 to the power 5-86675684777400460826851328213… (70 digits)
First ten multiples-61,316,796,395,737, -122,633,592,791,474, -183,950,389,187,211, -245,267,185,582,948, -306,583,981,978,685, -367,900,778,374,422, -429,217,574,770,159, -490,534,371,165,896, -551,851,167,561,633, -613,167,963,957,370
Powers of twoBetween 2^45 (35,184,372,088,832) and 2^46 (70,368,744,177,664)
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-6.13167964 × 10^15%
-61,316,796,395,737% as a decimal-613,167,963,957.37
-61,316,796,395,737% of 100-61,316,796,395,737
-61,316,796,395,737% of 1,000-613,167,963,957,370
As a fraction of 100-61,316,796,395,737/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -61,316,796,395,737
Also reads as
61316796395737 (identifier)
- 14 characters
- Checksum fails
61316796395737 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