Recognised as Number
-2,679,826,869
- Negative
- Odd
- Perfect cube
- 10 digits
-2,679,826,869 is an odd 10-digit integer and the negative of 2,679,826,869. It has 16 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value2,679,826,869
Digit count10
Digit sum63
Digit product31,352,832
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -1,389³
Factors & divisors
Prime factorisation−1 × 3^3 × 463^3
Distinct prime factors23, 463
Number of divisors16
Sum of divisors σ(n)3,978,707,200
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 463, 1,389, 4,167, 12,501, 214,369, 643,107, 1,929,321, 5,787,963, 99,252,847, 297,758,541, 893,275,623, 2,679,826,86916 in total
Arithmetic
Previous number-2,679,826,870
Next number-2,679,826,868
Double-5,359,653,738
Half-1,339,913,434.5
Square7,181,472,047,814,343,161
Cube-19,245,101,752,705,329,526,434,192,909
Cube root-1,389
Negation2,679,826,869
Reciprocal-3.73158435 × 10^-10≈
Representations
Decimal-2,679,826,869
Binary1001111110111010111010011011010132 bits
Octal23756564665
Hexadecimal9FBAE9B5
Base 3618BHZN9
In wordsminus two billion, six hundred and seventy-nine million, eight hundred and twenty-six thousand, eight hundred and sixty-nine
Ordinalminus two billion, six hundred and seventy-nine million, eight hundred and twenty-six thousand, eight hundred and sixty-ninth
Scientific notation-2.67982687 × 10^9
Engineering notation-2.679827 × 10^9
In other bases
Ternary20220202120022101000base 3; the most digit-efficient integer base after e: 20 digits
Quinary20442013424434base 5; one hand: 14 digits
Septenary123260103216base 7: 12 digits
Nonary6822508330base 9; each digit is two ternary digits: 10 digits
Duodecimal629575899base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal21h8i739base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal3:26:46:36:21:9base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT1T01T1T0110T01T0T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10100000010001010110101001011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111111111111111111111111111101100000010001010001011001001011
Bit length32 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits11within that length
Bit parityodd21 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 31worth 2,147,483,648
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes49f ba e9 b5
Gray code11010000011001111001110101101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit1111111111111111111111111111111101100000010001010001011001001011two's complement
One's complement0000000000000000000000000000000010011111101110101110100110110100at 64 bits, every bit flipped
Bits reversed1101001001101000101000100000011011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111011000000100010100010110010010111at 64 bits, wrapping
Shifted left by 1-100111111011101011101001101101010= -5,359,653,738, no wrap
Shifted right by 1-1001111110111010111010011011011= -1,339,913,434, discarding the low bit
These bits as a double1.32401039 × 10^-314≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-2,679,826,869 to the power 27,181,472,047,814,343,161
-2,679,826,869 to the power 3-19,245,101,752,705,329,526,434,192,909
-2,679,826,869 to the power 451,573,540,773,538,735,504,437,395,917,867,471,921
-2,679,826,869 to the power 5-13820816029439614761707560230… (49 digits)
First ten multiples-2,679,826,869, -5,359,653,738, -8,039,480,607, -10,719,307,476, -13,399,134,345, -16,078,961,214, -18,758,788,083, -21,438,614,952, -24,118,441,821, -26,798,268,690
Powers of twoBetween 2^31 (2,147,483,648) and 2^32 (4,294,967,296)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
As a percentage & fraction
As a percentage-267,982,686,900%
-2,679,826,869% as a decimal-26,798,268.69
-2,679,826,869% of 100-2,679,826,869
-2,679,826,869% of 1,000-26,798,268,690
As a fraction of 100-2,679,826,869/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -2,679,826,869
Also reads as
2679826869 (identifier)
- 10 characters
- Checksum fails
2679826869 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