Recognised as Number
-16,766,665
- Negative
- Odd
- 8 digits
-16,766,665 is an odd 8-digit integer and the negative of 16,766,665. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value16,766,665
Digit count8
Digit sum43
Digit product272,160
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 3,353,333
Distinct prime factors25, 3,353,333
Number of divisors4
Sum of divisors σ(n)20,120,004
SquarefreeYesno repeated prime factor
All divisors1, 5, 3,353,333, 16,766,6654 in total
Arithmetic
Previous number-16,766,666
Next number-16,766,664
Double-33,533,330
Half-8,383,332.5
Square281,121,055,222,225
Cube-4,713,462,557,357,547,129,625
Cube root-255.946323585≈
Negation16,766,665
Reciprocal-5.9642153 × 10^-8≈
Representations
Decimal-16,766,665
Binary11111111110101101100100124 bits
Octal77753311
HexadecimalFFD6C9
Base 369ZD8P
In wordsminus sixteen million, seven hundred and sixty-six thousand, six hundred and sixty-five
Ordinalminus sixteen million, seven hundred and sixty-six thousand, six hundred and sixty-fifth
Scientific notation-1.6766665 × 10^7
Engineering notation-16.766665 × 10^6
In other bases
Ternary1011112211112121base 3; the most digit-efficient integer base after e: 16 digits
Quinary13243013130base 5; one hand: 11 digits
Septenary262341256base 7: 9 digits
Nonary34484477base 9; each digit is two ternary digits: 8 digits
Duodecimal5746b21base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal54fgd5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:17:37:24:25base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryTT1111001111011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000000111100101001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000000000010100100110111
Bit length24 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits7within that length
Bit parityodd17 set bits, so odd; 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 d6 c9
Gray code100000000011110110101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000000000010100100110111two's complement
64-bit1111111111111111111111111111111111111111000000000010100100110111two's complement
One's complement00000000111111111101011011001000at 32 bits, every bit flipped
Bits reversed11101100100101000000000011111111at 32 bits
Rotated left by 111111110000000000101001001101111at 32 bits, wrapping
Shifted left by 1-1111111111010110110010010= -33,533,330, no wrap
Shifted right by 1-11111111110101101100101= -8,383,332, discarding the low bit
These bits as a double8.28383317 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-16,766,665 to the power 2281,121,055,222,225
-16,766,665 to the power 3-4,713,462,557,357,547,129,625
-16,766,665 to the power 479,029,047,689,257,277,944,133,950,625
-16,766,665 to the power 5-1,325,053,567,874,800,878,101,182,665,255,915,625
First ten multiples-16,766,665, -33,533,330, -50,299,995, -67,066,660, -83,833,325, -100,599,990, -117,366,655, -134,133,320, -150,899,985, -167,666,650
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 65
As a percentage & fraction
As a percentage-1,676,666,500%
-16,766,665% as a decimal-167,666.65
-16,766,665% of 100-16,766,665
-16,766,665% of 1,000-167,666,650
As a fraction of 100-16,766,665/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,766,665
Also reads as
16766665 (identifier)
- 8 characters
- Checksum fails
16766665 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