Recognised as Number
-9,506,571,157,504
- Negative
- Even
- Perfect cube
- 13 digits
-9,506,571,157,504 is an even 13-digit integer and the negative of 9,506,571,157,504. It has 76 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value9,506,571,157,504
Digit count13
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, -21,184³
Factors & divisors
Prime factorisation−1 × 2^18 × 331^3
Distinct prime factors22, 331
Number of divisors76
Sum of divisors σ(n)19,070,721,521,608
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 32, 64, 128, 256, 331, 512, 662, 1,024, 1,324, 2,048, 2,648, 4,096, 5,296, 8,192, 10,592, 16,384, 21,184, 32,768, 42,368, 65,536, 84,736, 109,561, 131,072, 169,472, 219,122, 262,144, 338,944, 438,244, 677,888, 876,488, 1,355,776, 1,752,976, 2,711,552, 3,505,952, 5,423,104, 7,011,904, 10,846,208, 14,023,808, 21,692,416, 28,047,616, 36,264,691, 43,384,832, 56,095,232, 72,529,382, 86,769,664, 112,190,464, 145,058,764, 224,380,928, 290,117,528, 448,761,856, 580,235,056, 897,523,712, 1,160,470,112, 1,795,047,424, 2,320,940,224, 3,590,094,848, 4,641,880,448, 7,180,189,696, 9,283,760,896, 14,360,379,392, 18,567,521,792, 28,720,758,784, 37,135,043,584, 74,270,087,168, 148,540,174,336, 297,080,348,672, 594,160,697,344, 1,188,321,394,688, 2,376,642,789,376, 4,753,285,578,752, 9,506,571,157,50476 in total
Arithmetic
Previous number-9,506,571,157,505
Next number-9,506,571,157,503
Double-19,013,142,315,008
Square90,374,895,172,686,942,375,510,016
Cube-859,155,371,811,113,167,744,578,800,227,465,560,064
Cube root-21,184
Negation9,506,571,157,504
Reciprocal-1.05190398 × 10^-13≈
Representations
Decimal-9,506,571,157,504
Binary1000101001010110101111001100000000000000000044 bits
Octal212255363000000
Hexadecimal8A56BCC0000
Base 363DB9B0J5S
In wordsminus nine trillion, five hundred and six billion, five hundred and seventy-one million, one hundred and fifty-seven thousand, five hundred and four
Ordinalminus nine trillion, five hundred and six billion, five hundred and seventy-one million, one hundred and fifty-seven thousand, five hundred and fourth
Scientific notation-9.50657116 × 10^12
Engineering notation-9.506571 × 10^12
In other bases
Ternary1020122211010021210221001201base 3; the most digit-efficient integer base after e: 28 digits
Quinary2221223424204020004base 5; one hand: 19 digits
Septenary2000553460364341base 7: 16 digits
Nonary36584107727051base 9; each digit is two ternary digits: 14 digits
Duodecimal109652b542454base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimalib7039edf4base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal3:23:45:31:43:30:25:4base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternaryTT1T1001TT0T0T011TT01T0T110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001010111110010100011101000000000000000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111101110101101010010100001101000000000000000000
Bit length44 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits30within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 43worth 8,796,093,022,208
Lowest set bitbit 1818 trailing zeros
Power of twoNo
Bytes608 a5 6b cc 00 00
Gray code11001111011111011110001010100000000000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111101110101101010010100001101000000000000000000two's complement
One's complement0000000000000000000010001010010101101011110010111111111111111111at 64 bits, every bit flipped
Bits reversed0000000000000000001011000010100101011010111011111111111111111111at 64 bits
Rotated left by 11111111111111111111011101011010100101000011010000000000000000001at 64 bits, wrapping
Shifted left by 1-100010100101011010111100110000000000000000000= -19,013,142,315,008, no wrap
Shifted right by 1-1000101001010110101111001100000000000000000= -4,753,285,578,752, discarding the low bit
These bits as a double4.69687022 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Nearest square below9,506,566,225,984
Nearest square above9,506,572,392,529
Powers & multiples
-9,506,571,157,504 to the power 290,374,895,172,686,942,375,510,016
-9,506,571,157,504 to the power 3-859,155,371,811,113,167,744,578,800,227,465,560,064
-9,506,571,157,504 to the power 4816762167747415359993631660189… (52 digits)
-9,506,571,157,504 to the power 5-77646076664480226551589277858… (66 digits)
First ten multiples-9,506,571,157,504, -19,013,142,315,008, -28,519,713,472,512, -38,026,284,630,016, -47,532,855,787,520, -57,039,426,945,024, -66,545,998,102,528, -76,052,569,260,032, -85,559,140,417,536, -95,065,711,575,040
Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
As a percentage & fraction
As a percentage-950,657,115,750,400%
-9,506,571,157,504% as a decimal-95,065,711,575.04
-9,506,571,157,504% of 100-9,506,571,157,504
-9,506,571,157,504% of 1,000-95,065,711,575,040
As a fraction of 100-9,506,571,157,504/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -9,506,571,157,504
Also reads as
9506571157504 (identifier)
- 13 characters
- Checksum fails
9506571157504 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). 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
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
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