Recognised as Number
-7,727,999,993
- Negative
- Odd
- 10 digits
-7,727,999,993 is an odd 10-digit integer and the negative of 7,727,999,993. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value7,727,999,993
Digit count10
Digit sum71
Digit product121,522,842
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 107 × 10,317,757
Distinct prime factors37, 107, 10,317,757
Number of divisors8
Sum of divisors σ(n)8,914,542,912
SquarefreeYesno repeated prime factor
All divisors1, 7, 107, 749, 10,317,757, 72,224,299, 1,103,999,999, 7,727,999,9938 in total
Arithmetic
Previous number-7,727,999,994
Next number-7,727,999,992
Double-15,455,999,986
Half-3,863,999,996.5
Square59,721,983,891,808,000,049
Cube-461,531,491,097,838,337,136,015,999,657
Cube root-1,977.071478698≈
Negation7,727,999,993
Reciprocal-1.29399586 × 10^-10≈
Representations
Decimal-7,727,999,993
Binary11100110010011111111010111111100133 bits
Octal71447765771
Hexadecimal1CC9FEBF9
Base 363JT1UYH
In wordsminus seven billion, seven hundred and twenty-seven million, nine hundred and ninety-nine thousand, nine hundred and ninety-three
Ordinalminus seven billion, seven hundred and twenty-seven million, nine hundred and ninety-nine thousand, nine hundred and ninety-third
Scientific notation-7.72799999 × 10^9
Engineering notation-7.728 × 10^9
In other bases
Ternary201221120121002000222base 3; the most digit-efficient integer base after e: 21 digits
Quinary111311331444433base 5; one hand: 15 digits
Septenary362335626140base 7: 12 digits
Nonary21846532028base 9; each digit is two ternary digits: 11 digits
Duodecimal15b8112275base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 10 digits
Vigesimal60ejjjjdbase 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal9:56:17:46:39:53base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT1T100111T11T0T100T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001110100101000000001010000011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111000110011011000000001010000000111
Bit length33 bitsto write the magnitude
Set bits23the population count, or Hamming weight
Zero bits10within that length
Bit parityodd23 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 32worth 4,294,967,296
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes501 cc 9f eb f9
Gray code100101010110100000001111000000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111000110011011000000001010000000111two's complement
One's complement0000000000000000000000000000000111001100100111111110101111111000at 64 bits, every bit flipped
Bits reversed1110000000101000000001101100110001111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111110001100110110000000010100000001111at 64 bits, wrapping
Shifted left by 1-1110011001001111111101011111110010= -15,455,999,986, no wrap
Shifted right by 1-11100110010011111111010111111101= -3,863,999,996, discarding the low bit
These bits as a double3.81813931 × 10^-314≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-7,727,999,993 to the power 259,721,983,891,808,000,049
-7,727,999,993 to the power 3-461,531,491,097,838,337,136,015,999,657
-7,727,999,993 to the power 43,566,715,359,973,374,231,702,263,285,397,184,002,401
-7,727,999,993 to the power 5-27563576276907228542781471047… (51 digits)
First ten multiples-7,727,999,993, -15,455,999,986, -23,183,999,979, -30,911,999,972, -38,639,999,965, -46,367,999,958, -54,095,999,951, -61,823,999,944, -69,551,999,937, -77,279,999,930
Powers of twoBetween 2^32 (4,294,967,296) and 2^33 (8,589,934,592)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
As a percentage & fraction
As a percentage-772,799,999,300%
-7,727,999,993% as a decimal-77,279,999.93
-7,727,999,993% of 100-7,727,999,993
-7,727,999,993% of 1,000-77,279,999,930
As a fraction of 100-7,727,999,993/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -7,727,999,993
Also reads as
7727999993 (identifier)
- 10 characters
- Checksum fails
7727999993 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