Recognised as Number
-16,513,264
- Negative
- Even
- 8 digits
-16,513,264 is an even 8-digit integer and the negative of 16,513,264. It has 30 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value16,513,264
Digit count8
Digit sum28
Digit product4,320
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^4 × 23^2 × 1,951
Distinct prime factors32, 23, 1,951
Number of divisors30
Sum of divisors σ(n)33,463,136
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 23, 46, 92, 184, 368, 529, 1,058, 1,951, 2,116, 3,902, 4,232, 7,804, 8,464, 15,608, 31,216, 44,873, 89,746, 179,492, 358,984, 717,968, 1,032,079, 2,064,158, 4,128,316, 8,256,632, 16,513,26430 in total
Arithmetic
Previous number-16,513,265
Next number-16,513,263
Double-33,026,528
Half-8,256,632
Square272,687,887,933,696
Cube-4,502,967,083,051,536,543,744
Cube root-254.650367947≈
Negation16,513,264
Reciprocal-6.05573798 × 10^-8≈
Representations
Decimal-16,513,264
Binary11111011111110001111000024 bits
Octal76774360
HexadecimalFBF8F0
Base 369TXPS
In wordsminus sixteen million, five hundred and thirteen thousand, two hundred and sixty-four
Ordinalminus sixteen million, five hundred and thirteen thousand, two hundred and sixty-fourth
Scientific notation-1.6513264 × 10^7
Engineering notation-16.513264 × 10^6
In other bases
Ternary1011001221221101base 3; the most digit-efficient integer base after e: 16 digits
Quinary13211411024base 5; one hand: 11 digits
Septenary260234425base 7: 9 digits
Nonary34057841base 9; each digit is two ternary digits: 8 digits
Duodecimal5644354base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal534334base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:16:27:1:4base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0TT0T100101TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000001000001101100010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000001000000011100010000
Bit length24 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits8within that length
Bit parityeven16 set bits, so even; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes3fb f8 f0
Gray code100001100000010010001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000001000000011100010000two's complement
64-bit1111111111111111111111111111111111111111000001000000011100010000two's complement
One's complement00000000111110111111100011101111at 32 bits, every bit flipped
Bits reversed00001000111000000010000011111111at 32 bits
Rotated left by 111111110000010000000111000100001at 32 bits, wrapping
Shifted left by 1-1111101111111000111100000= -33,026,528, no wrap
Shifted right by 1-11111011111110001111000= -8,256,632, discarding the low bit
These bits as a double8.15863644 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-16,513,264 to the power 2272,687,887,933,696
-16,513,264 to the power 3-4,502,967,083,051,536,543,744
-16,513,264 to the power 474,358,684,225,739,948,552,492,220,416
-16,513,264 to the power 5-1,227,904,583,312,279,365,793,721,893,675,597,824
First ten multiples-16,513,264, -33,026,528, -49,539,792, -66,053,056, -82,566,320, -99,079,584, -115,592,848, -132,106,112, -148,619,376, -165,132,640
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
As a percentage & fraction
As a percentage-1,651,326,400%
-16,513,264% as a decimal-165,132.64
-16,513,264% of 100-16,513,264
-16,513,264% of 1,000-165,132,640
As a fraction of 100-16,513,264/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,513,264
Also reads as
16513264 (identifier)
- 8 characters
- Checksum fails
16513264 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