Recognised as Number
-7,739,000,001
- Negative
- Odd
- 10 digits
-7,739,000,001 is an odd 10-digit integer and the negative of 7,739,000,001. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value7,739,000,001
Digit count10
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 29 × 139 × 213,319
Distinct prime factors43, 29, 139, 213,319
Number of divisors24
Sum of divisors σ(n)11,647,272,000
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 29, 87, 139, 261, 417, 1,251, 4,031, 12,093, 36,279, 213,319, 639,957, 1,919,871, 6,186,251, 18,558,753, 29,651,341, 55,676,259, 88,954,023, 266,862,069, 859,888,889, 2,579,666,667, 7,739,000,00124 in total
Arithmetic
Previous number-7,739,000,002
Next number-7,739,000,000
Double-15,478,000,002
Half-3,869,500,000.5
Square59,892,121,015,478,000,001
Cube-463,505,124,598,676,363,023,217,000,001
Cube root-1,978.009086172≈
Negation7,739,000,001
Reciprocal-1.29215661 × 10^-10≈
Representations
Decimal-7,739,000,001
Binary11100110101000111110001001100000133 bits
Octal71521742301
Hexadecimal1CD47C4C1
Base 363JZLMM9
In wordsminus seven billion, seven hundred and thirty-nine million and one
Ordinalminus seven billion, seven hundred and thirty-nine million and first
Scientific notation-7.739 × 10^9
Engineering notation-7.739 × 10^9
In other bases
Ternary201222100021221012200base 3; the most digit-efficient integer base after e: 21 digits
Quinary111322141000001base 5; one hand: 15 digits
Septenary362531262135base 7: 12 digits
Nonary21870257180base 9; each digit is two ternary digits: 11 digits
Duodecimal15bb937b69base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 10 digits
Vigesimal60i8f001base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal9:57:8:42:13:21base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT1T1001T00T0101TT10100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001110111110010000100111101000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111000110010101110000011101100111111
Bit length33 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits17within that length
Bit parityeven16 set bits, so even; 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 cd 47 c4 c1
Gray code100101011111001000010011010100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111000110010101110000011101100111111two's complement
One's complement0000000000000000000000000000000111001101010001111100010011000000at 64 bits, every bit flipped
Bits reversed1111110011011100000111010100110001111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111110001100101011100000111011001111111at 64 bits, wrapping
Shifted left by 1-1110011010100011111000100110000010= -15,478,000,002, no wrap
Shifted right by 1-11100110101000111110001001100001= -3,869,500,000, discarding the low bit
These bits as a double3.82357403 × 10^-314≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-7,739,000,001 to the power 259,892,121,015,478,000,001
-7,739,000,001 to the power 3-463,505,124,598,676,363,023,217,000,001
-7,739,000,001 to the power 43,587,066,159,732,661,498,035,352,726,030,956,000,001
-7,739,000,001 to the power 5-27760305013758133493028256244… (51 digits)
First ten multiples-7,739,000,001, -15,478,000,002, -23,217,000,003, -30,956,000,004, -38,695,000,005, -46,434,000,006, -54,173,000,007, -61,912,000,008, -69,651,000,009, -77,390,000,010
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 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-773,900,000,100%
-7,739,000,001% as a decimal-77,390,000.01
-7,739,000,001% of 100-7,739,000,001
-7,739,000,001% of 1,000-77,390,000,010
As a fraction of 100-7,739,000,001/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,739,000,001
Also reads as
7739000001 (identifier)
- 10 characters
- Checksum fails
7739000001 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