Recognised as Number
-934,007,359,375
- Negative
- Odd
- Perfect cube
- 12 digits
-934,007,359,375 is an odd 12-digit integer and the negative of 934,007,359,375. It has 112 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value934,007,359,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, -9,775³
Factors & divisors
Prime factorisation−1 × 5^6 × 17^3 × 23^3
Distinct prime factors35, 17, 23
Number of divisors112
Sum of divisors σ(n)1,296,827,150,400
SquarefreeNohas a repeated prime factor
All divisors1, 5, 17, 23, 25, 85, 115, 125, 289, 391, 425, 529, 575, 625, 1,445, 1,955, 2,125, 2,645, 2,875, 3,125, 4,913, 6,647, 7,225, 8,993, 9,775, 10,625, 12,167, 13,225, 14,375, 15,625, 24,565, 33,235, 36,125, 44,965, 48,875, 53,125, 60,835, 66,125, 71,875, 112,999, 122,825, 152,881, 166,175, 180,625, 206,839, 224,825, 244,375, 265,625, 304,175, 330,625, 359,375, 564,995, 614,125, 764,405, 830,875, 903,125, 1,034,195, 1,124,125, 1,221,875, 1,520,875, 1,653,125, 2,598,977, 2,824,975, 3,070,625, 3,516,263, 3,822,025, 4,154,375, 4,515,625, 5,170,975, 5,620,625, 6,109,375, 7,604,375, 8,265,625, 12,994,885, 14,124,875, 15,353,125, 17,581,315, 19,110,125, 20,771,875, 25,854,875, 28,103,125, 38,021,875, 59,776,471, 64,974,425, 70,624,375, 76,765,625, 87,906,575, 95,550,625, 103,859,375, 129,274,375, 140,515,625, 190,109,375, 298,882,355, 324,872,125, 353,121,875, 439,532,875, 477,753,125, 646,371,875, 1,494,411,775, 1,624,360,625, 1,765,609,375, 2,197,664,375, 2,388,765,625, 3,231,859,375, 7,472,058,875, 8,121,803,125, 10,988,321,875, 37,360,294,375, 40,609,015,625, 54,941,609,375, 186,801,471,875, 934,007,359,375112 in total
Arithmetic
Previous number-934,007,359,376
Next number-934,007,359,374
Double-1,868,014,718,750
Square872,369,747,366,660,400,390,625
Cube-814,799,764,136,570,340,481,227,874,755,859,375
Cube root-9,775
Negation934,007,359,375
Reciprocal-1.07065538 × 10^-12≈
Representations
Decimal-934,007,359,375
Binary110110010111011100101101010001111000111140 bits
Octal15456713243617
HexadecimalD9772D478F
Base 36BX2RV6VJ
In wordsminus nine hundred and thirty-four billion, seven million, three hundred and fifty-nine thousand, three hundred and seventy-five
Ordinalminus nine hundred and thirty-four billion, seven million, three hundred and fifty-nine thousand, three hundred and seventy-fifth
Scientific notation-9.34007359 × 10^11
Engineering notation-934.007359 × 10^9
In other bases
Ternary10022021211120121221020001base 3; the most digit-efficient integer base after e: 26 digits
Quinary110300321341000000base 5; one hand: 18 digits
Septenary124323400363606base 7: 15 digits
Nonary3267746557201base 9; each digit is two ternary digits: 13 digits
Duodecimal1310252121a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal1g9dh5ji8fbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal20:1:8:28:8:42:55base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryT0T01T0101111T10101TT1000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110111101110011001110101111100100110110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111110010011010001000110100101011100001110001
Bit length40 bitsto write the magnitude
Set bits24the population count, or Hamming weight
Zero bits16within that length
Bit parityeven24 set bits, so even; not the same as the number itself being odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes5d9 77 2d 47 8f
Gray code1011010111001100101110111110010001001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111110010011010001000110100101011100001110001two's complement
One's complement0000000000000000000000001101100101110111001011010100011110001110at 64 bits, every bit flipped
Bits reversed1000111000011101010010110001000101100100111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111100100110100010001101001010111000011100011at 64 bits, wrapping
Shifted left by 1-11011001011101110010110101000111100011110= -1,868,014,718,750, no wrap
Shifted right by 1-110110010111011100101101010001111001000= -467,003,679,687, discarding the low bit
These bits as a double4.61460949 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-934,007,359,375 to the power 2872,369,747,366,660,400,390,625
-934,007,359,375 to the power 3-814,799,764,136,570,340,481,227,874,755,859,375
-934,007,359,375 to the power 4761028976120570890581816314058… (48 digits)
-934,007,359,375 to the power 5-71080666439423434912981431288… (61 digits)
First ten multiples-934,007,359,375, -1,868,014,718,750, -2,802,022,078,125, -3,736,029,437,500, -4,670,036,796,875, -5,604,044,156,250, -6,538,051,515,625, -7,472,058,875,000, -8,406,066,234,375, -9,340,073,593,750
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
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 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 75
As a percentage & fraction
As a percentage-93,400,735,937,500%
-934,007,359,375% as a decimal-9,340,073,593.75
-934,007,359,375% of 100-934,007,359,375
-934,007,359,375% of 1,000-9,340,073,593,750
As a fraction of 100-934,007,359,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 -934,007,359,375
Also reads as
934007359375 (identifier)
- 12 characters
- Checksum valid
934007359375 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for Luhn (cards, IMEI). 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 validmod 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