Recognised as Number
-16,765,089
- Negative
- Odd
- 8 digits
-16,765,089 is an odd 8-digit integer and the negative of 16,765,089. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,765,089
Digit count8
Digit sum42
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 11 × 508,033
Distinct prime factors33, 11, 508,033
Number of divisors8
Sum of divisors σ(n)24,385,632
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 508,033, 1,524,099, 5,588,363, 16,765,0898 in total
Arithmetic
Previous number-16,765,090
Next number-16,765,088
Double-33,530,178
Half-8,382,544.5
Square281,068,209,177,921
Cube-4,712,133,541,938,462,399,969
Cube root-255.938304021≈
Negation16,765,089
Reciprocal-5.96477597 × 10^-8≈
Representations
Decimal-16,765,089
Binary11111111110100001010000124 bits
Octal77750241
HexadecimalFFD0A1
Base 369ZC0X
In wordsminus sixteen million, seven hundred and sixty-five thousand and eighty-nine
Ordinalminus sixteen million, seven hundred and sixty-five thousand and eighty-ninth
Scientific notation-1.6765089 × 10^7
Engineering notation-16.765089 × 10^6
In other bases
Ternary1011112202101020base 3; the most digit-efficient integer base after e: 16 digits
Quinary13242440324base 5; one hand: 11 digits
Septenary262333545base 7: 9 digits
Nonary34482336base 9; each digit is two ternary digits: 8 digits
Duodecimal5746029base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal54fce9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:17:36:58:9base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryTT111101T1T0TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000000111000010100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000000000010111101011111
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes3ff d0 a1
Gray code100000000011100011110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000000000010111101011111two's complement
64-bit1111111111111111111111111111111111111111000000000010111101011111two's complement
One's complement00000000111111111101000010100000at 32 bits, every bit flipped
Bits reversed11111010111101000000000011111111at 32 bits
Rotated left by 111111110000000000101111010111111at 32 bits, wrapping
Shifted left by 1-1111111111010000101000010= -33,530,178, no wrap
Shifted right by 1-11111111110100001010001= -8,382,544, discarding the low bit
These bits as a double8.28305452 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-16,765,089 to the power 2281,068,209,177,921
-16,765,089 to the power 3-4,712,133,541,938,462,399,969
-16,765,089 to the power 478,999,338,210,483,554,658,633,882,241
-16,765,089 to the power 5-1,324,430,936,039,857,526,888,361,654,185,884,449
First ten multiples-16,765,089, -33,530,178, -50,295,267, -67,060,356, -83,825,445, -100,590,534, -117,355,623, -134,120,712, -150,885,801, -167,650,890
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
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 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
As a percentage & fraction
As a percentage-1,676,508,900%
-16,765,089% as a decimal-167,650.89
-16,765,089% of 100-16,765,089
-16,765,089% of 1,000-167,650,890
As a fraction of 100-16,765,089/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -16,765,089
Also reads as
16765089 (identifier)
- 8 characters
- Checksum fails
16765089 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. 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
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
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