Recognised as Number
-310,976,734,375
- Negative
- Odd
- Perfect cube
- 12 digits
-310,976,734,375 is an odd 12-digit integer and the negative of 310,976,734,375. It has 28 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value310,976,734,375
Digit count12
Digit sum55
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
Perfect cubeYes, -6,775³
Factors & divisors
Prime factorisation−1 × 5^6 × 271^3
Distinct prime factors25, 271
Number of divisors28
Sum of divisors σ(n)390,155,630,944
SquarefreeNohas a repeated prime factor
All divisors1, 5, 25, 125, 271, 625, 1,355, 3,125, 6,775, 15,625, 33,875, 73,441, 169,375, 367,205, 846,875, 1,836,025, 4,234,375, 9,180,125, 19,902,511, 45,900,625, 99,512,555, 229,503,125, 497,562,775, 1,147,515,625, 2,487,813,875, 12,439,069,375, 62,195,346,875, 310,976,734,37528 in total
Arithmetic
Previous number-310,976,734,376
Next number-310,976,734,374
Double-621,953,468,750
Square96,706,529,322,539,306,640,625
Cube-30,073,480,681,463,454,661,678,314,208,984,375
Cube root-6,775
Negation310,976,734,375
Reciprocal-3.21567465 × 10^-12≈
Representations
Decimal-310,976,734,375
Binary10010000110011110101000011001001010011139 bits
Octal4414752062247
Hexadecimal4867A864A7
Base 363YUZINXJ
In wordsminus three hundred and ten billion, nine hundred and seventy-six million, seven hundred and thirty-four thousand, three hundred and seventy-five
Ordinalminus three hundred and ten billion, nine hundred and seventy-six million, seven hundred and thirty-four thousand, three hundred and seventy-fifth
Scientific notation-3.10976734 × 10^11
Engineering notation-310.976734 × 10^9
In other bases
Ternary1002201200111120220112201base 3; the most digit-efficient integer base after e: 25 digits
Quinary20043340021000000base 5; one hand: 17 digits
Septenary31316202425356base 7: 14 digits
Nonary1081614526481base 9; each digit is two ternary digits: 13 digits
Duodecimal5032958bb47base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalc2j04bfifbase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal6:39:55:7:6:12:55base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryT0T01T110T11111T01T11010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100100011101001101010001110110010101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111011011110011000010101111001101101011001
Bit length39 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits21within that length
Bit parityeven18 set bits, so even; not the same as the number itself being odd
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes548 67 a8 64 a7
Gray code110110001010100011111000101011011110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111011011110011000010101111001101101011001two's complement
One's complement0000000000000000000000000100100001100111101010000110010010100110at 64 bits, every bit flipped
Bits reversed1001101011011001111010100001100111101101111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111110110111100110000101011110011011010110011at 64 bits, wrapping
Shifted left by 1-1001000011001111010100001100100101001110= -621,953,468,750, no wrap
Shifted right by 1-10010000110011110101000011001001010100= -155,488,367,187, discarding the low bit
These bits as a double1.53642921 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-310,976,734,375 to the power 296,706,529,322,539,306,640,625
-310,976,734,375 to the power 3-30,073,480,681,463,454,661,678,314,208,984,375
-310,976,734,375 to the power 4935215281361115472659459260946… (46 digits)
-310,976,734,375 to the power 5-29083019413527649479492323742… (59 digits)
First ten multiples-310,976,734,375, -621,953,468,750, -932,930,203,125, -1,243,906,937,500, -1,554,883,671,875, -1,865,860,406,250, -2,176,837,140,625, -2,487,813,875,000, -2,798,790,609,375, -3,109,767,343,750
Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 75
As a percentage & fraction
As a percentage-31,097,673,437,500%
-310,976,734,375% as a decimal-3,109,767,343.75
-310,976,734,375% of 100-310,976,734,375
-310,976,734,375% of 1,000-3,109,767,343,750
As a fraction of 100-310,976,734,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 -310,976,734,375
Also reads as
310976734375 (identifier)
- 12 characters
- Checksum fails
310976734375 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