Recognised as Number
-8,132,727,332
- Negative
- Even
- 10 digits
-8,132,727,332 is an even 10-digit integer and the negative of 8,132,727,332. It has 12 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value8,132,727,332
Digit count10
Digit sum38
Digit product84,672
Multiplicative persistence7times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 503 × 4,042,111
Distinct prime factors32, 503, 4,042,111
Number of divisors12
Sum of divisors σ(n)14,260,571,136
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 503, 1,006, 2,012, 4,042,111, 8,084,222, 16,168,444, 2,033,181,833, 4,066,363,666, 8,132,727,33212 in total
Arithmetic
Previous number-8,132,727,333
Next number-8,132,727,331
Double-16,265,454,664
Half-4,066,363,666
Square66,141,253,856,659,838,224
Cube-537,908,783,012,807,876,551,023,138,368
Cube root-2,011.000000082≈
Negation8,132,727,332
Reciprocal-1.22959981 × 10^-10≈
Representations
Decimal-8,132,727,332
Binary11110010010111111100100100010010033 bits
Octal74457711044
Hexadecimal1E4BF9224
Base 363QI0KKK
In wordsminus eight billion, one hundred and thirty-two million, seven hundred and twenty-seven thousand, three hundred and thirty-two
Ordinalminus eight billion, one hundred and thirty-two million, seven hundred and twenty-seven thousand, three hundred and thirty-second
Scientific notation-8.13272733 × 10^9
Engineering notation-8.132727 × 10^9
In other bases
Ternary202222210011100120102base 3; the most digit-efficient integer base after e: 21 digits
Quinary113123434233312base 5; one hand: 15 digits
Septenary405352020212base 7: 12 digits
Nonary22883140512base 9; each digit is two ternary digits: 11 digits
Duodecimal16ab773518base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 10 digits
Vigesimal6719ai6cbase 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal10:27:31:30:55:32base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT1T00001T00TTT0T110TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001101111010000011011001000101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111000011011010000000110110111011100
Bit length33 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits16within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being even
Highest set bitbit 32worth 4,294,967,296
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes501 e4 bf 92 24
Gray code100010110111000000101101100110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111000011011010000000110110111011100two's complement
One's complement0000000000000000000000000000000111100100101111111001001000100011at 64 bits, every bit flipped
Bits reversed0011101110110110000000101101100001111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111110000110110100000001101101110111001at 64 bits, wrapping
Shifted left by 1-1111001001011111110010010001001000= -16,265,454,664, no wrap
Shifted right by 1-11110010010111111100100100010010= -4,066,363,666, discarding the low bit
These bits as a double4.01810118 × 10^-314≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-8,132,727,332 to the power 266,141,253,856,659,838,224
-8,132,727,332 to the power 3-537,908,783,012,807,876,551,023,138,368
-8,132,727,332 to the power 44,374,665,461,731,119,923,691,387,769,969,851,474,176
-8,132,727,332 to the power 5-35577961368977079038374703649… (51 digits)
First ten multiples-8,132,727,332, -16,265,454,664, -24,398,181,996, -32,530,909,328, -40,663,636,660, -48,796,363,992, -56,929,091,324, -65,061,818,656, -73,194,545,988, -81,327,273,320
Powers of twoBetween 2^32 (4,294,967,296) and 2^33 (8,589,934,592)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 8
Divisible by 100No, remainder 32
As a percentage & fraction
As a percentage-813,272,733,200%
-8,132,727,332% as a decimal-81,327,273.32
-8,132,727,332% of 100-8,132,727,332
-8,132,727,332% of 1,000-81,327,273,320
As a fraction of 100-8,132,727,332/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -8,132,727,332
Also reads as
8132727332 (identifier)
- 10 characters
- Checksum fails
8132727332 matches the shape of ISBN-10, 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-10Check digit does not matchmod 11 with weights 10 down to 1
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